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.
2020
2020
Variants of best-first search algorithms and their expansions have continuously been introduced to solve challenging problems… 
2019
2019
Probability based proof number search (PPN-search) is a game tree search algorithm improved from proof number search (PN-search… 
2019
2019
Game playing provides the medium for a variety of algorithms to formulate play decisions that surpass human expert. However, the… 
2018
2018
Finding the minimax value of a game is an important problem in a variety of fields, including game theory, decision theory… 
2013
2013
Efficient best-first search algorithms have been developed for deterministic two-player games with two-outcome.We present a… 
2012
2012
We present an application of Multi-Agent Modal Logic K (MMLK) to model dynamic strategy game properties. We also provide several… 
2011
2011
This thesis deals with the different ways to solve games, with a special focus on solving the game of Pentago. Pentago is a new… 
2007
2007
We apply probability theory to the task of proving whether a goal can be achieved by a player in an adversarial game. Such… 
2006
2006
Over the years, proof-number search has successfully been applied to many game domains. This article proposes two new pattern…