Static analysis of life and death in the game of Go

This paper describes heuristic rules for static life/death analysis for general classes of groups in the game of Go, as implemented in authorsÕ world championship computer Go programs Go Intellect and HandTalk. We shall show that for many life and death problems in Go, the eect of a tree search can be approximated by a static analysis on the groupÕs interior and surroundings. We investigate eye-spaces with or without op-ponentÕs dead stones and try to provide a foundation towards conquering the combi