<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The Complexity of Flood Filling Games · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1001.4420/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1001.4420/feed.xml" rel="self" type="application/rss+xml" /><item><title>The Complexity of Flood Filling Games — mentioned by smnscu</title><link>https://news.ycombinator.com/item?id=30202228</link><guid isPermaLink="false">urn:hackerpapers:mention:1001.4420:30202228</guid><pubDate>Fri, 04 Feb 2022 02:54:42 GMT</pubDate><description>&lt;p&gt;Thank you for the link, fun game! Took me a while to win, but this is what immediately made my strategy work: From http://retirementexperiment.blogspot.com/2009/03/flood-it-ga...: &amp;gt; The approach I use is to play for penetration. I aim for the opposite corner. Rarely the obstacles have too much repetition. I would allow for this by requiring a wedge shape having a favorable ratio of base size to length. Bonus, a paper on flood-it: https://arxiv.org/abs/1001.4420&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1001.4420/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>The Complexity of Flood Filling Games — mentioned by jnazario</title><link>https://news.ycombinator.com/item?id=7451293</link><guid isPermaLink="false">urn:hackerpapers:mention:1001.4420:7451293</guid><pubDate>Sat, 22 Mar 2014 23:13:58 GMT</pubDate><description>&lt;p&gt;two kinds of buzz - playing and making. making is easy for the reasons outlined by protomyth. playing, i think, is NP-hard, and that makes games really addictive. see this research: http://arxiv.org/pdf/1001.4420v3.pdf which talks about flood filling games as being NP-hard. there&amp;#x27;s a satisfaction we get when we succeed that tickles our humanity in a unique way.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1001.4420/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item><item><title>The Complexity of Flood Filling Games — HN submission</title><link>https://news.ycombinator.com/item?id=2887569</link><guid isPermaLink="false">urn:hackerpapers:submission:1001.4420:2887569</guid><pubDate>Mon, 15 Aug 2011 16:35:47 GMT</pubDate><description>&lt;p&gt;Flood-it is NP-hard&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/1001.4420/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.DS</category></item></channel></rss>
