Improving Monte–Carlo Tree Search in Havannah

  • Richard J. Lorentz
Conference paper

DOI: 10.1007/978-3-642-17928-0_10

Volume 6515 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Lorentz R.J. (2011) Improving Monte–Carlo Tree Search in Havannah. In: van den Herik H.J., Iida H., Plaat A. (eds) Computers and Games. CG 2010. Lecture Notes in Computer Science, vol 6515. Springer, Berlin, Heidelberg

Abstract

Havannah is a game played on an hexagonal board of hexagons where the base of the board typically ranges from four to ten hexagons. The game is known to be difficult to program. We study an MCTS-based approach to programming Havannah using our program named Wanderer. We experiment with five techniques of the basic MCTS algorithms and demonstrate that at normal time controls of approximately 30 seconds per move Wanderer can make quite strong moves with bases of size four or five, and play a reasonable game with bases of size six or seven. At longer time controls (ten minutes per move) Wanderer (1) appears to play nearly perfectly with base four, (2) is difficult for most humans to beat at base five, and (3) gives a good game at bases six and seven. Future research focuses on larger board sizes.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Richard J. Lorentz
    • 1
  1. 1.Department of Computer ScienceCalifornia State UniversityNorthridgeUSA