Building a World-Champion Arimaa Program
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.
KeywordsHuman Player Goal Evaluation Strong Player Weak Player Trap Evaluation
Unable to display preview. Download preview PDF.
- 1.Akl, S.G., Newborn, M.M.: The Principle Continuation and the Killer Heuristic. In: ACM Annual Conference, pp. 466–473 (1977)Google Scholar
- 2.Schaeffer, J.: The History Heuristic. ICCA Journal 6(3), 16–19 (1983)Google Scholar
- 4.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)Google Scholar
- 5.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)Google Scholar
- 6.Reinfeld, A.: An Improvement on the Scout Tree Search Algorithm. ICCA Journal 6(4), 4–14 (1983)Google Scholar
- 7.Donninger, C.: Null Move and Deep Search: Selective-Search Heuristics for Obtuse Chess Programs. ICCA Journal 16(3), 137–143 (1993)Google Scholar