MoHex 2.0: a pattern-based MCTS Hex player
Full Text: 2013-CG-Mohex2.0.pdf
In recent years the Monte Carlo tree search revolution has spread from computer Go to many areas, including computer Hex. MCTS Hex players now outperform traditional knowledge-based alpha-beta search players, and the reigning Computer Olympiad Hex gold medallist is the MCTS player MoHex. In this paper we show how to strengthen MoHex, and observe that — as in computer Go — using learned patterns in priors and replacing a hand-crafted simulation policy with a softmax policy that uses learned patterns can significantly increase playing strength. The result is MoHex 2.0, about 250 Elo stronger than MoHex on the 11×11 board, and 300 Elo stronger on 13×13.
Citation
S. Huang, B. Arneson, R. Hayward, M. Müller. "MoHex 2.0: a pattern-based MCTS Hex player". Computers and Games, pp 39-48, January 2013.| Keywords: | |
| Category: | In Journal |
BibTeX
@article{Huang+al:13,
author = {Shih-Chieh Huang and Broderick Arneson and Ryan Hayward and Martin
Müller},
title = {MoHex 2.0: a pattern-based MCTS Hex player},
Pages = {39-48},
journal = {Computers and Games},
year = 2013,
}Last Updated: June 30, 2020Submitted by Sabina P
