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 条

[21] A new proof-number search algorithm application to lines of action
Winands, MHM
Uiterwijk, JWHM
van den Herik, J
COMPUTERS AND GAMES, 2003, 2883 : 61 - +
[22] Monte-Carlo proof-number search for computer Go
Saito, Jahn-Takeshi
Chaslot, Guillaume
Uiterwijk, Jos W. H. M.
van den Herik, H. Jaap
COMPUTERS AND GAMES, 2007, 4630 : 50 - +
[23] An effective two-level proof-number search algorithm
Winands, MHM
Uiterwijk, JWHM
van den Herik, HJ
THEORETICAL COMPUTER SCIENCE, 2004, 313 (03) : 511 - 525
[24] Depth-first proof search without backtracking for free-variable clausal tableaux
Beckert, B
JOURNAL OF SYMBOLIC COMPUTATION, 2003, 36 (1-2) : 117 - 138
[25] Some remarks on distributed depth-first search
Tsin, YH
INFORMATION PROCESSING LETTERS, 2002, 82 (04) : 173 - 178
[26] A Framework for Verifying Depth-First Search Algorithms
Lammich, Peter
Neumann, Rene
CPP'15: PROCEEDINGS OF THE 2015 ACM CONFERENCE ON CERTIFIED PROGRAMS AND PROOFS, 2015, : 137 - 146
[27] Depth-First Search Encoding of RNA Substructures
Chen, Qingfeng
Lan, Chaowang
Li, Jinyan
Chen, Baoshan
Wang, Lusheng
Zhang, Chengqi
INTELLIGENT COMPUTING THEORIES AND APPLICATION, ICIC 2016, PT I, 2016, 9771 : 328 - 334
[28] Anytime AND/OR Depth-First Search for Combinatorial Optimization
Otten, Lars
Dechter, Rina
PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2014, 2014, 8656 : 933 - 937
[29] Job-Level Proof-Number Search for Connect6
Wu, I-Chen
Lin, Hung-Hsuan
Lin, Ping-Hung
Sun, Der-Johng
Chan, Yi-Chih
Chen, Bo-Ting
COMPUTERS AND GAMES, 2011, 6515 : 11 - 22
[30] DEPTH-FIRST SEARCH AND KURATOWSKI SUBGRAPHS.
Williamson, S.G.
1600, (31):

← 1 2 3 4 5 →