Monte Carlo Tree Search in Hex

Hex, the classic board game invented by Piet Hein in 1942 and independently by John Nash in 1948, has been a domain of artificial intelligence research since Claude Shannon's seminal work in the 1950s. Until the Monte Carlo Go revolution a few years ago, the best computer Hex players used knowledge-intensive alpha-beta search. Since that time, strong Monte Carlo Hex players have appeared that are on par with the best alpha-beta Hex players. In this paper we describe MoHex, the Monte Carlo Tree Search Hex player that won gold in the 2009 Computer Olympiad. Our main contributions to Monte Carlo Tree Search include using inferior cell analysis and connection strategy computation to prune the search tree. In particular, we run our random game simulations not on the actual game position, but on a reduced equivalent board.

• Type: Journal
• Year: 2010
• Where: TCIAIG
• Authors: Broderick Arneson, Ryan B. Hayward, Philip Henderson
• Keywords: Hex Player, Monte Carlo, Monte Carlo Tree, Software Engineering, TCIAIG 2010