An Improved Safety Solver for Computer Go

Most Go-playing programs use a combination of search and heuristics based on an influence function to determine whether territories are safe. However, to assure the correct evaluation of Go positions, the safety of stones and territories must be proved by an exact method. The first exact algorithm, due to Benson [1], determines the unconditional safety of stones and territories. M

• Type: Conference
• Year: 2004
• Where: CG
• Authors: Xiaozhen Niu, Martin Müller 0003
• Keywords: CG 2004, Computer Graphics, Exact Method, Most Go-playing Programs, Stronger Search-based Techniques