Proof-number search

DOI10.1016/0004-3702(94)90004-3zbMath0801.90145OpenAlexW1990386132MaRDI QIDQ1321057

Maarten van der Meulen, H. Jaap van den Herik, L. Victor Allis

Publication date: 1 December 1994

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(94)90004-3

zbMATH Keywords

proof-number searchgame treescn-searchgame-theoretical valuepn- search

Mathematics Subject Classification ID

Games involving graphs (91A43) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (21)

An effective two-level proof-number search algorithm ⋮ Conspiracy number search with relative sibling scores ⋮ Proof-Number Search and Its Variants ⋮ Dynamic programming and board games: a survey ⋮ Minimal Proof Search for Modal Logic K Model Checking ⋮ Best-first fixed-depth minimax algorithms ⋮ Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information ⋮ The advertisement game solutions of manufacturers' noncooperative strategy – application of dynamic programming method ⋮ The \(PN^{*}\)-search algorithm: Application to tsume-shogi ⋮ Monte-Carlo Tree Search Solver ⋮ A New Proof-Number Calculation Technique for Proof-Number Search ⋮ About the Completeness of Depth-First Proof-Number Search ⋮ Weak Proof-Number Search ⋮ Computer shogi ⋮ Games solved: Now and in the future ⋮ Computer Go: An AI oriented survey ⋮ On solving the 7,7,5-game and the 8,8,5-game ⋮ CONNECTIVITY IN THE GAME OF GO ⋮ MONTE CARLO GO CAPTURING TACTIC SEARCH ⋮ BEST PLAY IN FANORONA LEADS TO DRAW ⋮ A solution to the GHI problem for best-first search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Depth-first iterative-deepening: An optimal admissible tree search
• Conspiracy numbers for min-max search
• A minimax algorithm better than alpha-beta?
• Embedding decision-analytic control in a learning architecture
• Principles of metareasoning
• Optimal problem-solving search: All-or-none solutions
• An analysis of alpha-beta pruning
• Heuristic search in restricted memory
• A comparison of minimax tree search algorithms
• Qubic: 4 × 4 × 4 Tic-Tac-Toe
• Depth-m search in branch-and-bound algorithms
• Experiments With Some Programs That Search Game Trees

This page was built for publication: Proof-number search