Skip to main content
SpringerLink
Log in

Building a World-Champion Arimaa Program

  • Conference paper
Book cover Computers and Games (CG 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3846))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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 

  3. 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)

    Article  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 

Download references

Author information

Authors and Affiliations

  1. Smart Games, San Jose, CA, USA

    David Fotland

Authors
  1. David Fotland
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Games and AI Group, MICC, Faculty of Humanities and Sciences, Universiteit Maastricht, Maastricht, The Netherlands

    H. Jaap van den Herik

  2. School of Computer Science, Reykjavík University, Reykjavík, Iceland

    Yngvi Björnsson

  3. Center for Automation Research, University of Maryland, College Park, MD 20742, USA

    Nathan S. Netanyahu

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation