Using Artificial Boundaries in the Game of Go

Authors:
Ling Zhao;Martin Müller
Affiliations:
Department of Computing Science, University of Alberta, Edmonton, Canada T6G 2E8;Department of Computing Science, University of Alberta, Edmonton, Canada T6G 2E8
Venue:
CG '08 Proceedings of the 6th international conference on Computers and Games
Year:
2008

Citing 6
Cited 0

Forward pruning and other heuristic search techniques in tsume go

Information Sciences: an International Journal - Special issue on Heuristic search and computer game playing
Combining online and offline knowledge in UCT

Proceedings of the 24th international conference on Machine learning
Search versus knowledge for solving life and death problems in Go

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Bandit based monte-carlo planning

ECML'06 Proceedings of the 17th European conference on Machine Learning
Solving probabilistic combinatorial games

ACG'05 Proceedings of the 11th international conference on Advances in Computer 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.02

Visualization

Abstract

Local search in the game of Go is easier if local areas have well-defined boundaries. An artificial boundary consists of temporarily added stones that close off an area. This paper describes a new general framework for finding boundaries in a way such that existing local search methods can be used. Furthermore, by using a revised local UCT search method, it is shown experimentally that this framework increases performance on local Go problems with open boundaries.