National Yang Ming Chiao Tung University

Solving 7x7 Killall-Go with Seki Database

The research addresses the computational challenge of solving 7x7 Killall-Go, a variant of Go where Black attempts to capture all White stones.

• Integrating a pre-computed seki database into a 7x7 Killall-Go solver increases the success rate for positions containing seki patterns from below 7% to over 85%.
• The use of a seki lookup table enables the resolution of previously unsolvable positions within 482 seconds, compared to a 24-hour timeout threshold.
• General performance metrics show a 10% to 20% improvement in both wall-clock time and node count when utilizing the database for game solving.