The \(PN^{*}\)-search algorithm: Application to tsume-shogi
From MaRDI portal
Publication:5941318
DOI10.1016/S0004-3702(01)00084-4zbMath0971.68039OpenAlexW2061653391MaRDI QIDQ5941318
No author found.
Publication date: 20 August 2001
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(01)00084-4
Related Items (5)
An effective two-level proof-number search algorithm ⋮ Proof-Number Search and Its Variants ⋮ Weak Proof-Number Search ⋮ Computer shogi ⋮ Games solved: Now and in the future
Cites Work
- Linear-space best-first search
- Depth-first iterative-deepening: An optimal admissible tree search
- Admissibility of \(AO^ *\) when heuristics overestimate
- Conspiracy numbers for min-max search
- Reducing reexpansions in iterative-deepening search by controlling cutoff bounds
- Generalized AND/OR graphs
- An analysis of alpha-beta pruning
- Proof-number search
- Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search
- Agent searching in a tree and the optimality of iterative deepening
- A solution to the GHI problem for best-first search
- A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
- An admissible and optimal algorithm for searching AND/OR graphs
- Best-first fixed-depth minimax algorithms
- AND/OR graph heuristic search methods
- The Power of Dominance Relations in Branch-and-Bound Algorithms
- Optimizing decision trees through heuristically guided search
- Experiments With Some Programs That Search Game Trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The \(PN^{*}\)-search algorithm: Application to tsume-shogi
