mlsanityData to 14 Oct 2026

Combining Monte-Carlo Tree Search with Proof-Number Search

arXiv 2206.03965 ↗First posted 8 Jun 2022cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

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%.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 2 of its 41 references that are in the map. First posted on arXiv 8 Jun 2022.

Builds on

2 of 41 references.

References · 2

  1. 2019Ludii -- The Ludemic General Game Systemcited by 39
  2. 2014Monte Carlo Tree Search with Heuristic Evaluations using Implicit Minimax Backupscited by 11

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 0; 2025: 1.

2 papers.

  1. 2023Proof Number Based Monte-Carlo Tree Searchcited by 3
  2. 2025Generalized Proof-Number Monte-Carlo Tree Searchcited by 0