Selected Algorithms from the 2013 Toads-and-Frogs Blitz Tournament

Article type: Research Article

Authors: Wieczorek, Wojciech¹ | Skinderowicz, Rafał¹ | Kozak, Jan¹ | Juszczuk, Przemysław¹ | Nowakowski, Arkadiusz¹

Affiliations: Sosnowiec, Poland

Note: [1] Institute of Computer Science, University of Silesia, Poland, corresponding author: email: [email protected]

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.

DOI: 10.3233/ICG-2013-36405

Journal: ICGA Journal, vol. 36, no. 4, pp. 222-227, 2013