Skip to search formSkip to main contentSkip to account menu

Proof-number search

Proof-number search (short: PN search) is a game tree search algorithm invented by Victor Allis, with applications mostly in endgame solvers, but… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Probability based proof number search (PPN-search) is a game tree search algorithm improved from proof number search (PN-search… 
2010
2010
This paper proposes a new approach for proof number (PN) search, named job-level PN (JL-PN) search, where each search tree node… 
2010
2010
This article introduces Evaluation-Function based Proof-Number Search (EF-PN) and its second-level variant EF-PN2. It is a… 
2010
2010
Over the years, an increasing number of two-player games has been added to the list of solved games. However, solving multi… 
2009
2009
Proof-Number Search (PNS) is a powerful method for solving games and game positions. Over the years, the research on PNS has… 
2008
2008
The paper concerns an AND/OR-tree search algorithm to solve hard problems. Proof-number search is a well-known powerful search… 
2008
2008
Proof-Number (PN) search is a best-first adversarial search algorithm especially suited for finding the game-theoretical value in… 
2008
2008
We propose a new simple calculation technique for proof numbers in Proof-Number Search. Search algorithms based on (dis)proof… 
2006
2006
In the last decade, proof-number search and Monte-Carlo methods have successfully been applied to the combinatorial-games domain… 
2002
2002
The paper introduces a new proof-number (PN) search algorithm, called PDS-PN. It is a two-level search, which performs at the…