An effective two-level proof-number search algorithm

Authors:
Mark H. M. Winands;Jos W. H. M. Uiterwijk;H. Jaap van den Herik
Affiliations:
Department of Computer Science, Institute for Knowledge and Agent Technology, Universiteit Maastricht, P.O. Box 616, Maastricht 6200 MD, Netherlands;Department of Computer Science, Institute for Knowledge and Agent Technology, Universiteit Maastricht, P.O. Box 616, Maastricht 6200 MD, Netherlands;Department of Computer Science, Institute for Knowledge and Agent Technology, Universiteit Maastricht, P.O. Box 616, Maastricht 6200 MD, Netherlands
Venue:
Theoretical Computer Science - Algorithmic combinatorial game theory
Year:
2004

Citing 10
Cited 5

Conspiracy numbers for min-max search

Artificial Intelligence
Conspiracy numbers

Artificial Intelligence - Special issue on computer chess
Proof-number search

Artificial Intelligence
Best-first fixed-depth minimax algorithms

Artificial Intelligence
A solution to the GHI problem for best-first search

Theoretical Computer Science
Parallel controlled conspiracy number search

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
The PN -search algorithm: application to tsume-shogi

Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Deep Blue

Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Move Ordering Using Neural Networks

Proceedings of the 14th International conference on Industrial and engineering applications of artificial intelligence and expert systems: engineering of intelligent systems
The principal continuation and the killer heuristic

ACM '77 Proceedings of the 1977 annual conference

Enhancements of proof number search in Connect6

CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Monte-Carlo proof-number search for computer Go

CG'06 Proceedings of the 5th international conference on Computers and games
Improving depth-first PN-search: 1 + Ɛ trick

CG'06 Proceedings of the 5th international conference on Computers and games
Evaluation-function based proof-number search

CG'10 Proceedings of the 7th international conference on Computers and games
An improved safety solver for computer go

CG'04 Proceedings of the 4th international conference on Computers and Games

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents a new proof-number (PN) search algorithm, called PDS-PN. It is a two-level search (like PN2), which performs at the first level a depth-first proof-number and disproof-number search (PDS), and at the second level a best-first PN search. Hence, PDS-PN selectively exploits the power of both PN2 and PDS. Experiments in the domain of Lines of Action are performed. They show that within an acceptable time frame PDS-PN is more effective for really hard endgame positions than αβ and any other PN-search algorithm.