Search Versus Knowledge for Solving Life and Death Problems in Go
Abstract
In games research, Go is considered the classical board game that is most resistant to current AI techniques. Large-scale knowledge engineering has been considered indispensable for building state of the art programs, even for subprob-lems such as Life and Death, or tsume-Go. This paper de-scribes the technologies behind TSUMEGO EXPLORER, a high-performance tsume-Go search engine for enclosed prob-lems. In empirical testing, this engine outperforms GoTools, which has been the undisputedly best tsume-Go program for 15 years.
Cite
Text
Kishimoto and Müller. "Search Versus Knowledge for Solving Life and Death Problems in Go." AAAI Conference on Artificial Intelligence, 2005.Markdown
[Kishimoto and Müller. "Search Versus Knowledge for Solving Life and Death Problems in Go." AAAI Conference on Artificial Intelligence, 2005.](https://mlanthology.org/aaai/2005/kishimoto2005aaai-search/)BibTeX
@inproceedings{kishimoto2005aaai-search,
title = {{Search Versus Knowledge for Solving Life and Death Problems in Go}},
author = {Kishimoto, Akihiro and Müller, Martin},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2005},
pages = {1374-1379},
url = {https://mlanthology.org/aaai/2005/kishimoto2005aaai-search/}
}