affix's blog

By affix, 13 years ago, In English
Hi.
there is such a simple & cool game "flood it!".
i wonder is there any optimal algorithm that could discover what are the best choices in the game to finish it in minimum step?
if you just play once you could understand the rules of the game.
  • Vote: I like it
  • +21
  • Vote: I do not like it

»
13 years ago, # |
Rev. 3   Vote: I like it +3 Vote: I do not like it

http://arxiv.org/abs/1001.4420


This paper proves several interesting statements about the problem - in particular, it is np-hard for greater than 2 colors.