论文信息 - A comparative study of solvers in Amazons endgames

A comparative study of solvers in Amazons endgames

The game of Amazons is a fairly young member of the class of territory-games. The best Amazons programs play now at a high level, but can still be defeated by humans expert of the game. Our focus here is on the solving of endgames, with the goal of improving the general playing level of Amazons programs. Our comparative study of four solvers, DFPN, WPNS, Alpha/Beta and Monte-Carlo Tree-Search, shows that usual game-playing methods used for Amazons, namely Alpha-Beta and Monte-Carlo Tree-Search, are best suited for this task. This result also emphasizes the need of an evaluation function for the game of Amazons.

Hiroyuki Iida | Bruno Bouzy | Julien Kloetzer

[1] Hiroyuki Iida,et al. Weak Proof-Number Search , 2008, Computers and Games.

[2] Keh-Hsun Chen,et al. MONTE-CARLO GO TACTIC SEARCH , 2007 .

[3] Hiroyuki Iida,et al. AND/OR-Tree Search Algorithms in Shogi Mating Search , 2001, J. Int. Comput. Games Assoc..

[4] Bernd Brügmann Max-Planck. Monte Carlo Go , 1993 .

[5] Theodore Tegos,et al. Experiments in Computer Amazons , 2002 .

[6] H. Jaap van den Herik,et al. Proof-Number Search , 1994, Artif. Intell..

[7] R.K. Guy,et al. On numbers and games , 1978, Proceedings of the IEEE.

[8] Csaba Szepesvári,et al. Bandit Based Monte-Carlo Planning , 2006, ECML.

[9] Donald E. Knuth,et al. The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm , 1981, ICALP.

[10] Julien Kloetzer,et al. The Monte-Carlo Approach in Amazons , 2007 .

[11] Jens Lieberum,et al. An evaluation function for the game of amazons , 2005, Theor. Comput. Sci..

[12] Bruce Abramson,et al. Expected-Outcome: A General Model of Static Evaluation , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[13] David A. McAllester. Conspiracy Numbers for Min-Max Search , 1988, Artif. Intell..

[14] 長井歩,et al. Df-pn algorithm for searching AND/OR trees and its applications , 2002 .