The Algorithm of Move Death Piece In Computer Go

摘要

The problem of move death piece out of board in the game of Computer Go is in essence a special case of coloring in an any enclosed, curved area on a plane. It's the primary algorithm to design of Computer Go. The article want to solve this problem by Breadth-First-Search and Constraint-Condition Local-Search. The program by mean of Stack instead of Recursion. This program has been successful run in a computer and the Internet.