Proof-Set Search (2001)
Cached
Download Links
- [www.cs.ualberta.ca]
- [www.cs.ualberta.ca]
- DBLP
Other Repositories/Bibliography
| Citations: | 5 - 1 self |
BibTeX
@TECHREPORT{Müller01proof-setsearch,
author = {Martin Müller},
title = {Proof-Set Search},
institution = {},
year = {2001}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Victor Allis' proof-number search is a powerful best-first tree search method which can solve games by repeatedly expanding a most-proving node in the game tree. A well-known problem of proof-number search is that it does not account for the effect of transpositions. If the search builds a directed acyclic graph instead of a tree, the same node can be counted more than once, leading to incorrect proof and disproof numbers. While there are exact methods for computing proof numbers in DAG's, they are too slow to be practical. Proof-set search (PSS) is a new search method which uses a similar value propagation scheme as proof-number search, but backs up proof and disproof sets instead of numbers. While the sets computed by proof-set search are not guaranteed to be of minimal size, they do provide provably tighter bounds than is possible with proof numbers. The generalization proof-set search with (P,D)-truncated node sets or PSSP;D provides a well-controlled tradeoff between...
Keyphrases
proof-set search proof-number search proof number similar value propagation scheme most-proving node well-known problem new search method node set victor allis disproof number exact method well-controlled tradeoff generalization proof-set search directed acyclic graph disproof set game tree powerful best-first tree search method minimal size
