About the Completeness of Depth-First Proof-Number Search

被引：0
|
作者：
Kishimoto, Akihiro [1 ]
Mueller, Martin [2 ]
机构：
[1] Future Univ Hakodate 116 2, Dept Media Architecture, Hakodate, Hokkaido 0418655, Japan
[2] Univ Alberta, Dept Comp Sci, Edmonton, AB T6G 2E8, Canada
来源：
COMPUTERS AND GAMES | 2008年 / 5131卷
基金：
加拿大自然科学与工程研究理事会;
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
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 theoretical properties remain poorly understood. This paper resolves the question of completeness of df-pn: its ability to solve any finite boolean-valued game tree search problem in principle, given unlimited amounts of time and memory. The main results are that df-pn is complete on finite directed acyclic graphs (DAG) but incomplete on finite directed cyclic graphs (DCG).
引用
收藏
页码：146 / +
页数：2
相关论文
共 50 条
  • [31] Anytime AND/OR depth-first search for combinatorial optimization
    Otten, Lars
    Dechter, Rina
    AI COMMUNICATIONS, 2012, 25 (03) : 211 - 227
  • [32] Depth-first search in directed planar graphs, revisited
    Allender, Eric
    Chauhan, Archit
    Datta, Samir
    ACTA INFORMATICA, 2022, 59 (04) : 289 - 319
  • [33] Improving the efficiency of depth-first search by cycle elimination
    Dillenburg, John F., 1600, (45):
  • [34] Depth-first search for solving job scheduling problem
    Zhang, Xuanping
    Hang, Shengce
    Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering & Electronics, 1998, 20 (08): : 19 - 22
  • [35] Duplicate Avoidance in Depth-First Search with Applications to Treewidth
    Dow, P. Alex
    Korf, Richard E.
    21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, 2009, : 480 - 485
  • [36] A PARALLEL ALGORITHM FOR RECOGNIZING UNORDERED DEPTH-FIRST SEARCH
    SCHEVON, CA
    VITTER, JS
    INFORMATION PROCESSING LETTERS, 1988, 28 (02) : 105 - 110
  • [37] Efficient semi-external depth-first search
    Wan, Xiaolong
    Wang, Hongzhi
    INFORMATION SCIENCES, 2022, 599 : 170 - 191
  • [38] Finding strong components using depth-first search
    Tarjan, Robert E.
    Zwick, Uri
    EUROPEAN JOURNAL OF COMBINATORICS, 2024, 119
  • [39] THE AVERAGE COMPLEXITY OF DEPTH-FIRST SEARCH WITH BACKTRACKING AND CUTOFF
    STONE, HS
    SIPALA, P
    IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1986, 30 (03) : 242 - 258
  • [40] Depth-First Heuristic Search for Software Model Checking
    Maeoka, Jun
    Tanabe, Yoshinori
    Ishikawa, Fuyuki
    COMPUTER AND INFORMATION SCIENCE 2015, 2016, 614 : 75 - 96
12345