Dao: a benchmark game

  • Authors:

  • H. (Jeroen) H. L. M. Donkers;H. Jaap van den Herik;Jos W. H. M. Uiterwijk

  • Affiliations:

  • Department of Computer Science, Institute for Knowledge and Agent Technology, Universiteit Maastricht, Maastricht, The Netherlands;Department of Computer Science, Institute for Knowledge and Agent Technology, Universiteit Maastricht, Maastricht, The Netherlands;Department of Computer Science, Institute for Knowledge and Agent Technology, Universiteit Maastricht, Maastricht, The Netherlands

  • Venue:
  • CG'04 Proceedings of the 4th international conference on Computers and Games
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Dao is an attractive game to play, although it is solvable in a few seconds on a computer. The game is so small that the complete game graph can be kept in internal memory. At the same time, the number of nodes in the game graph of Dao is large enough to allow interesting analyses. In the game spectrum, Dao resides between on the one hand trivial games such as Tic-Tac-Toe and Do-Guti and on the other hand games, such as Connect-Four and Awari that are solved but of which the game graph cannot be kept in memory. In this paper we provide many detailed properties of Dao and its solution. Our conclusion is that a game like Dao can be used as a benchmark of search enhancements. As an illustration we provide an example concerning the size of transposition tables in α-β search.