Strategy and Implementation of Hex

With the development of computer game algorithms, some new chesses are gradually included in the competitions in China. Hex is a new game that Chinese have just begun to focus on recently. Since Hex has a priority problem, and the larger the chessboard, the larger the search space. Therefore, how to reduce the costs of search and calculation is an important problem in hex games. It has proposed two strategies based on geometry of its cell geometry (LRC) and chessboard region (CR) for Hex game, and combined them with Monte Carlo tree search. These strategies can be used in Monte Carlo tree search to filter out unreasonable or optimal results at the current level, so as to reduce the scope of search space. A platform has been designed and developed, it provides human-AI even AI-AI interface to the Hex game.