Recently, monte-carlo tree search (mcts) has advanced the field of computer go substantially. Also in the game of lines of action (loa), which has been dominated so far by aß, mcts is making an inroad. In this paper we investigate how to use a positional evaluation function in a monte-carlo simulation-based loa program (mc-loa). Four different simulation strategies are designed, called evaluation cut-off, corrective, greedy, and mixed. They use an evaluation function in several ways. Experimental results reveal that the mixed strategy is the best among them. This strategy draws the moves randomly based on their transition probabilities in the first part of a simulation, but selects them based on their evaluation score in the second part of a simulation. Using this simulation strategy the mc-loa program plays at the same level as the aß program mia, the best loa-playing entity in the world.
|Title of host publication||Advances in Computer Games|
|Subtitle of host publication||12th International Conference, ACG 2009, Pamplona Spain, May 11-13, 2009. Revised Papers|
|Editors||H. Jaap van den Herik, Pieter Spronck|
|Place of Publication||Berlin, Heidelberg|
|Number of pages||12|
|Publication status||Published - 2010|
|Series||Lecture Notes in Computer Science|