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 条
  • [41] Fully Dynamic Depth-First Search in Directed Graphs
    Yang, Bohua
    Wen, Dong
    Qin, Lu
    Zhang, Ying
    Wang, Xubo
    Lin, Xuemin
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2019, 13 (02): : 142 - 154
  • [42] Multi-core Nested Depth-First Search
    Laarman, Alfons
    Langerak, Rom
    van de Pol, Jaco
    Weber, Michael
    Wijs, Anton
    AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, 2011, 6996 : 321 - +
  • [43] Depth-first search in directed planar graphs, revisited
    Eric Allender
    Archit Chauhan
    Samir Datta
    Acta Informatica, 2022, 59 : 289 - 319
  • [44] Depth-First Search Using O(n) Bits
    Kiyomi, Masashi (masashi@yokohama-cu.ac.jp), 1600, Springer Verlag (8889):
  • [45] Finding Strong Components Using Depth-First Search
    Department of Computer Science, Princeton University, NJ, United States
    不详
    CA, United States
    不详
    arXiv,
  • [46] Depth-First Search Using O(n) Bits
    Asano, Tetsuo
    Izumi, Taisuke
    Kiyomi, Masashi
    Konagaya, Matsuo
    Ono, Hirotaka
    Otachi, Yota
    Schweitzer, Pascal
    Tarui, Jun
    Uehara, Ryuhei
    ALGORITHMS AND COMPUTATION, ISAAC 2014, 2014, 8889 : 553 - 564
  • [47] Parallel Depth-First Search for Directed Acyclic Graphs
    Naumov, Maxim
    Vrielink, Alysson
    Garland, Michael
    PROCEEDINGS OF IA3 2017: SEVENTH WORKSHOP ON IRREGULAR APPLICATIONS: ARCHITECTURES AND ALGORITHMS, 2017,
  • [48] A depth-first search algorithm for oligonucleotide design in gene assembly
    Liang, Hanjie
    Chen, Zengrui
    Fang, Gang
    FRONTIERS IN GENETICS, 2022, 13
  • [49] PLANAR STRONG CONNECTIVITY HELPS IN PARALLEL DEPTH-FIRST SEARCH
    KAO, MY
    SIAM JOURNAL ON COMPUTING, 1995, 24 (01) : 46 - 62
  • [50] Snap-stabilizing depth-first search on arbitrary networks
    Cournier, A
    Devismes, S
    Petit, F
    Villain, V
    PRINCIPLES OF DISTRIBUTED SYSTEMS, 2005, 3544 : 267 - 282
12345