Sciweavers

Share
80 search results - page 1 / 16
» Parallel Depth First Proof Number Search
Sort
View
AAAI
2010
9 years 12 months ago
Parallel Depth First Proof Number Search
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simpl...
Tomoyuki Kaneko
AAAI
2010
9 years 12 months ago
Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
Akihiro Kishimoto
CG
2008
Springer
10 years 13 days ago
About the Completeness of Depth-First Proof-Number Search
Abstract. Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its t...
Akihiro Kishimoto, Martin Müller 0003
IJCAI
2007
9 years 12 months ago
Lambda Depth-First Proof Number Search and Its Application to Go
Kazuki Yoshizoe, Akihiro Kishimoto, Martin Mü...
IJCAI
1997
9 years 11 months ago
Interleaved Depth-First Search
In tree search, depth-first search (DFS) often uses ordering successor heuristics. If the heuristic makes a mistake ordering a bad successor (without goals in its subtree) before ...
Pedro Meseguer
books