Combining Monte-Carlo Tree Search with Proof-Number Search

06/08/2022
by   Elliot Doe, et al.
0

Proof-Number Search (PNS) and Monte-Carlo Tree Search (MCTS) have been successfully applied for decision making in a range of games. This paper proposes a new approach called PN-MCTS that combines these two tree-search methods by incorporating the concept of proof and disproof numbers into the UCT formula of MCTS. Experimental results demonstrate that PN-MCTS outperforms basic MCTS in several games including Lines of Action, MiniShogi, Knightthrough, and Awari, achieving win rates up to 94.0

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset