The most exciting game for me, among many others I have programmed, happens to be one I casually participated in for 2 months,
the Google AI challenge 2011 - Ants. It seems this sentiment is shared with many other participants as well, and it not just the number
of participants, or the short time one has to produce a bot, that made it so exciting. It has some elements carefully designed to avoid
traditional approaches in game tree search, such as using brute force alpha-beta. E.g. The time limit for making a move was limited to 500ms
that basically forces you to rely on other means. The game rules are very simple but lead to a complex optimization problem between different
competing factors. Go has also simple rules and becomes complex, which is probably why it is considered better than chess as a test bed for AI.
However one would wonder with the success of MCTS with pruned trees, it may be going the same path as Chess, only now the problem is bigger!
Ants OTOH will not allow for brute force search because of incomplete information and other factors. These are my opinions. A summary of
another person's opinion that led me to make this post can be found here. What are your thoughts
