The Strategies for Simple One-Point Ko Situation of Computer Go

Abstract

[[abstract]]Ko plays a very important role in Go, but most computer Go programs still cannot handle ko fights so far. Utilizing the principle of Minimax procedure, we obtain the best strategies for the simple one-point ko situation, enabling computer Go programs to gain maximum or loss minimum profit when dealing with the simple one-point ko situation. We also discuss in detail the strategies for using ko threats during the process of the ko fight.