Abstract
When a game is complex, analysis of the game state and finding a good move can often be time consuming. This note provides a description of four algorithms—two classic and two unconventional ones—for playing two-player games under severe time constraints. Toads-and-Frogs has been chosen as a testbed because, despite the simple rule set, the evaluation of its positions is an NP-hard problem. These algorithms were used in programs which took leading places in a computer Toads-and-Frogs blitz tournament held at the Silesian University in Poland.
Get full access to this article
View all access options for this article.