Abstract
Arimaa is a new two-player strategy game designed by Omar Syed to be difficult for computer players. Omar offers a $10,000 prize to the first program to beat a top human player. My program, Bot_Bomb, won the 2004 computer championship, but failed to beat Omar for the prize. This paper describes the problems with building a strong Arimaa program and details of the program’s design.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Akl, S.G., Newborn, M.M.: The Principle Continuation and the Killer Heuristic. In: ACM Annual Conference, pp. 466–473 (1977)
Schaeffer, J.: The History Heuristic. ICCA Journal 6(3), 16–19 (1983)
Schaeffer, J.: The History Heuristic and Alpha-Beta Enhancements in Practice. IEEE Transactions on Pattern Analysis and Machine Intelligence archive 11(11), 1203–1212 (1989)
Zobrist, A.L.: A Hashing Method with Applications for Game Playing, Technical Report 88, Computer Science Department, University of Wisconsin Madison 1970, reprinted in ICCA Journal, Vol. 13, No. 2, pp. 69–73 (1990)
Slate, D.J., Atkin, L.R.: Chess 4.5 – The Northwestern University Chess Program. In: Chess Skill in Man and Machine, pp. 82–118. Springer, Heidelberg (1977)
Reinfeld, A.: An Improvement on the Scout Tree Search Algorithm. ICCA Journal 6(4), 4–14 (1983)
Donninger, C.: Null Move and Deep Search: Selective-Search Heuristics for Obtuse Chess Programs. ICCA Journal 16(3), 137–143 (1993)
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
Fotland, D. (2006). Building a World-Champion Arimaa Program. 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_12
Download citation
DOI: https://doi.org/10.1007/11674399_12
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)