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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Allis, L.V.: Searching for Solutions in Games and Artificial Intelligence. PhD thesis, Rijksuniversiteit Limburg, Maastricht, The Netherlands (1994)
Beal, D.F., Smith, M.C.: Quantification of search-extension benefits. ICCA Journal 18(4), 205–218 (1995)
Blake, C.L., Merz, C.J.: UCI repository of machine learning databases (1998), http://www.ics.uci.edu/~mlearn/mlrepository.html
Breuker, D.M.: Memory versus Search in Games. PhD thesis, Universiteit Maastricht, Maastricht, The Netherlands (1998)
Breuker, D.M., Uiterwijk, J.W.H.M., van den Herik, H.J.: Replacement schemes for transposition tables. ICCA Journal 17(4), 183–193 (1994)
Donkers, H.H.L.M.: Dao page (2003), http://www.cs.unimaas.nl/
Handscomb, K.: Dao (game review). Abstract Games Magazine 6, 7 (2001)
Irving, G., Donkers, H.H.L.M., Uiterwijk, J.W.H.M.: Solving Kalah. ICGA Journal 23(3), 139–148 (2000)
Lovász, L.: Random walks on graphs: A survey. Combinatorics: Paul Erdös is Eighty 2, 1–46 (1993)
Murray, H.J.R.: A History of Board Games other than Chess. Oxford University Press, Oxford (1952)
PlayDAO.com. Official Dao home page (1999), http://www.playdao.com
Thompson, K.: Retrograde analysis of certain endgames. ICCA Journal 9(3), 131–139 (1986)
van den Herik, H.J., Herschberg, I.S.: The construction of an omniscient endgame database. ICCA Journal 8(3), 141–149 (1985)
van den Herik, H.J., Uiterwijk, J.W.H.M., van Rijswijck, J.: Games solved: Now and in the future. Artificial Intelligence Journal 134(1-2), 277–311 (2002)
Williamson, S.G.: Combinatorics for Computer Science. Computer Science Press, Rockville (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Donkers, H.(.H.L.M., van den Herik, H.J., Uiterwijk, J.W.H.M. (2006). Dao: A Benchmark Game. In: van den Herik, H.J., Björnsson, Y., Netanyahu, N.S. (eds) Computers and Games. CG 2004. Lecture Notes in Computer Science, vol 3846. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11674399_14
Download citation
DOI: https://doi.org/10.1007/11674399_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32488-1
Online ISBN: 978-3-540-32489-8
eBook Packages: Computer ScienceComputer Science (R0)