Lambda depth-first proof number search and its application to go

Authors:
Kazuki Yoshizoe;Akihiro Kishimoto;Martin Müller
Affiliations:
Dept. of Electrical, Electronic, and Communication Engineering, Chuo University, Japan;Department of Media Architecture, Future University-Hakodate, Japan;Dept. of Computing Science, University of Alberta, Canada
Venue:
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Year:
2007

Citing 4
Cited 1

Linear-space best-first search

Artificial Intelligence
Proof-number search

Artificial Intelligence
Search versus knowledge for solving life and death problems in Go

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Solving checkers

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence

A New Proof-Number Calculation Technique for Proof-Number Search

CG '08 Proceedings of the 6th international conference on Computers and Games

Quantified Score

Hi-index	0.00

Visualization

Abstract

Thomsen's λ search and Nagai's depth-first proof-number (DFPN) search are two powerful but very different AND/OR tree search algorithms. Lambda Depth-First Proof Number search (LDFPN) is a novel algorithm that combines ideas from both algorithms. λ search can dramatically reduce a search space by finding different levels of threat sequences. DFPN employs the notion of proof and disproof numbers to expand nodes expected to be easiest to prove or disprove. The method was shown to be effective for many games. Integrating λ order with proof and disproof numbers enables LDFPN to select moves more effectively, while preserving the efficiency of DFPN. LDFPN has been implemented for capturing problems in Go and is shown to be more efficient than DFPN and more robust than an algorithm based on classical λ search.