Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,398,550 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
And–or tree
Search algorithm
Victor Allis
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Characterizing the Nature of Probability-Based Proof Number Search: A Case Study in the Othello and Connect Four Games
Anggina Primanita
,
M. Khalid
,
H. Iida
Inf.
2020
Corpus ID: 219419334
Variants of best-first search algorithms and their expansions have continuously been introduced to solve challenging problems…
Expand
2019
2019
Probability based Proof Number Search
Zhang Song
,
H. Iida
,
H. J. Herik
International Conference on Agents and Artificial…
2019
Corpus ID: 88486984
Probability based proof number search (PPN-search) is a game tree search algorithm improved from proof number search (PN-search…
Expand
2019
2019
Single Conspiracy Number Analysis in Checkers
Sarot Busala
,
Zhang Song
,
H. Iida
,
M. Khalid
,
U. Yusof
International Conference on Agents and Artificial…
2019
Corpus ID: 88497375
Game playing provides the medium for a variety of algorithms to formulate play decisions that surpass human expert. However, the…
Expand
2018
2018
Bounded Suboptimal Game Tree Search
Dor Atzmon
,
Roni Stern
,
Abdallah Saffidine
Symposium on Combinatorial Search
2018
Corpus ID: 51687024
Finding the minimax value of a game is an important problem in a variety of fields, including game theory, decision theory…
Expand
2013
2013
Solving Games and All That
Abdallah Saffidine
2013
Corpus ID: 115534641
Efficient best-first search algorithms have been developed for deterministic two-player games with two-outcome.We present a…
Expand
2012
2012
A General Multi-Agent Modal Logic K Framework for Game Tree Search
Abdallah Saffidine
,
T. Cazenave
2012
Corpus ID: 9557844
We present an application of Multi-Agent Modal Logic K (MMLK) to model dynamic strategy game properties. We also provide several…
Expand
2011
2011
On Solving Pentago Betrachtung Der Lösbarkeit Des Spiels Pentago Bachelor-thesis Von Niklas Büscher Aus Münster Mai 2011 on Solving Pentago Betrachtung Der Lösbarkeit Des Spiels Pentago Vorgelegte…
Johannes Fürnkranz
,
Tag der Einreichung
2011
Corpus ID: 2868731
This thesis deals with the different ways to solve games, with a special focus on solving the game of Pentago. Pentago is a new…
Expand
2007
2007
Learning to solve game trees
David H. Stern
,
R. Herbrich
,
T. Graepel
International Conference on Machine Learning
2007
Corpus ID: 10695716
We apply probability theory to the task of proving whether a goal can be achieved by a player in an adversarial game. Such…
Expand
2006
2006
Pattern knowledge for proof-number search in computer Go
Jahn-Takeshi Saito
,
Guillaume Chaslot
,
J. Uiterwijk
,
H. J. Herik
2006
Corpus ID: 15396503
Over the years, proof-number search has successfully been applied to many game domains. This article proposes two new pattern…
Expand
2006
2006
Developments in Monte-Carlo proof-number search
Jahn-Takeshi Saito
,
Guillaume Chaslot
,
J. Uiterwijk
,
H. J. Herik
,
M. Winands
2006
Corpus ID: 62937258
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE