About the Completeness of Depth-First Proof-Number Search

DOI10.1007/978-3-540-87608-3_14MaRDI QIDQ3601830zbMATH OpenOpenAlexFDO

Authors

Publication date 12 February 2009

Published in Computers and Games (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-87608-3_14

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) 2-person games (91A05) Experimental studies (91A90)

Recommendations

• Proof-Number Search and Its Variants
• Proof-number search
• Depth-first iterative-deepening: An optimal admissible tree search
• The \(PN^{*}\)-search algorithm: Application to tsume-shogi
• Scalable Parallel DFPN Search

Cites work

• Checkers is solved
• scientific article; zbMATH DE number 43243 (Why is no real title available?)
• Proof-number search

Cited in

(5)

• An effective two-level proof-number search algorithm
• Scalable Parallel DFPN Search
• Evaluation-function based proof-number search
• Weak Proof-Number Search
• Refinements to depth-first iterative-deepening search in automatic theorem proving

This page was built for publication: About the Completeness of Depth-First Proof-Number Search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3601830)