earticle

영어

We present a method that enable to efficiently prove tactical theorems in the game of Go. We have experimented theorem proving with different tactical sub-games of the game of Go: the capture game, the connection game, the eye and the life and death games. Theorem proving works very well for tactical Go problem solving. The moves it finds are always correct and it finds the move faster than usual algorithms. In this paper we present our algorithms associated to concrete examples, and we outline the possible applications that might interest Go players: teaching programs for beginner's to learn to capture and connect stones, problem solving programs for intermediate players, and even some applications that might interest good players such as a perfect 5x5 Go problem solver and composer.