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.
http://arxiv.org/abs/1001.4420