Learning to estimate potential territory in the game of go

Authors:
Erik C. D. van der Werf;H. Jaap van den Herik;Jos W. H. M. Uiterwijk
Affiliations:
Department of Computer Science, Institute for Knowlegde and Agent Technology, Universiteit Maastricht, Maastricht, The Netherlands;Department of Computer Science, Institute for Knowlegde and Agent Technology, Universiteit Maastricht, Maastricht, The Netherlands;Department of Computer Science, Institute for Knowlegde and Agent Technology, Universiteit Maastricht, Maastricht, The Netherlands
Venue:
CG'04 Proceedings of the 4th international conference on Computers and Games
Year:
2004

Citing 6
Cited 1

Computer Go: an AI oriented survey

Artificial Intelligence
Computer Go

Artificial Intelligence - Chips challenging champions: games, computers and Artificial Intelligence
Honte, a go-playing program using neural nets

Machines that learn to play games
Heuristic analysis of large trees as generated in the game of 'go'

Heuristic analysis of large trees as generated in the game of 'go'
A model of visual organization for the game of GO

AFIPS '69 (Spring) Proceedings of the May 14-16, 1969, spring joint computer conference
Life in the game of Go

Information Sciences: an International Journal

Learning to score final positions in the game of Go

Theoretical Computer Science - Advances in computer games

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates methods for estimating potential territory in the game of Go. We have tested the performance of direct methods known from the literature, which do not require a notion of life and death. Several enhancements are introduced which can improve the performance of the direct methods. New trainable methods are presented for learning to estimate potential territory from examples. The trainable methods can be used in combination with our previously developed method for predicting life and death [25]. Experiments show that all methods are greatly improved by adding knowledge of life and death.