Abstract:
The life-and-death problem in Go is a basic and essential problem to be overcome in implementing a computer Go program. This paper proposes a new heuristic searching model which can reduce the branching factor in a game tree. For constructing the first level of a game tree, we implement pattern clustering and eye shape analysis to get the set of the first moves, thereby reducing the branching factor of the game tree. The empirical result for game tree searching with these methods is promising. We also suggest several problems to address for making game tree searching more robust, such as: coping with situations where the number of legal moves in the surrounded group is more than 8, creating an accurate heuristic evaluation function, and dealing with ko fighting.
Description:
You are granted permission for the non-commercial reproduction, distribution, display, and performance of this technical report in any format, BUT this permission is only for a period of 45 (forty-five) days from the most recent time that you verified that this technical report is still available from the original CITR web site; http://citr.auckland.ac.nz/techreports/ under terms that include this permission. All other rights are reserved by the author(s).