An improved safety solver for computer Go

DMCA

An improved safety solver for computer Go (2006)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Xiaozhen Niu , Martin Müller

Venue:	Computers and Games: 4th International Conference, CG 2004. LNCS 3846
Citations:	2 - 2 self

BibTeX

@INPROCEEDINGS{Niu06animproved,
    author = {Xiaozhen Niu and Martin Müller},
    title = {An improved safety solver for computer Go},
    booktitle = {Computers and Games: 4th International Conference, CG 2004. LNCS 3846},
    year = {2006},
    pages = {97--112},
    publisher = {Springer}
}

OpenURL

Abstract

Abstract. Most Go-playing programs use a combination of search and heuristics based on an influence function to determine whether territories are safe. However, to assure the correct evaluation of Go positions, the safety of stones and territories must be proved by an exact method. The first exact algorithm, due to Benson [1], determines the unconditional safety of stones and territories. Müller [3] develops static rules for detecting safety by alternating play, and introduces search-based methods. This paper describes new, stronger search-based techniques including regionmerging and a new method for efficiently solving weakly dependent regions. In a typical final position, more than half the points on the board can be proved safe by our current solver. This almost doubles the number of proven points compared to the 26.4 % reported in [3]. 1

Keyphrases

improved safety solver computer go typical final position new method first exact algorithm search-based technique unconditional safety go-playing program current solver introduces search-based method exact method weakly dependent region proven point influence function go position correct evaluation develops static rule

DMCA