Abstract
Monte-Carlo algorithms and their UCT-like successors have recently shown remarkable promise for Go-playing programs. We apply some of these same algorithms to an Amazons-playing program. Our experiments suggest that a pure MC/UCT type program for playing Amazons has little promise, but by using strong evaluation functions we are able to create a hybrid MC/UCT program that is superior to both the basic MC/UCT program and the conventional minimax-based programs. The MC/UCT program is able to beat Invader, a strong minimax program, over 80% of the time at tournament time controls. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Lorentz, R. J. (2008). Amazons discover Monte-Carlo. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5131 LNCS, pp. 13–24). https://doi.org/10.1007/978-3-540-87608-3_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
