Solving Go On Small Boards

Solving Go On Small Boards (2003)

by Erik C. D. van der Werf , H. Jaap Van Den Herik , Jos W. H. M. Uiterwijk

Venue:	International Computer Games Association Journal
Citations:	10 - 1 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Solving Go On Small Boards	user correction - Legacy Corrections
AUTHOR NAME	Erik C. D. van der Werf	user correction - Legacy Corrections
AUTHOR NAME	H. Jaap Van Den Herik	user correction - Legacy Corrections
AUTHOR AFFIL	1	user correction - Legacy Corrections
AUTHOR NAME	Jos W. H. M. Uiterwijk	user correction - Legacy Corrections
AUTHOR AFFIL	1	user correction - Legacy Corrections
AUTHOR ADDR	Maastricht, The Netherlands	user correction - Legacy Corrections
ABSTRACT	This article presents a search-based approach of solving Go on small boards. A dedicated heuristic evaluation function combined with the static recognition of unconditional territory is used in an alpha-beta framework with several domain-dependent and domain-independent search enhancements. We present two variants of the GHI problem (caused by super-ko rules) with some possible solutions. Our program, MIGOS, solves all small empty square boards up to 55 and can be applied to any enclosed problem of similar size.	user correction - Legacy Corrections
YEAR	2003	INFERENCE
VENUE	International Computer Games Association Journal	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	10--7	INFERENCE
VOLUME	26	INFERENCE
CITATIONS	27 found	ParsCit 1.0