![]() StartingPoints Paths Referenced by
|
Go Research on Semeai
Path: GiveMeLiberties · Prev: SemeaiDiscussion · Next: CountingLiberties
Keywords: Tactics
The article describes the steps of an algorithm to identify semeai. It then classifies semeai in 9 classes (of increasing complexity to solve). It goes on describing semeai evaluation, the safety of stones (does winning the semeai mean that you win the fight?) and determining the game value of winning the semeai. Finally it shows two full board example game positions, that were used to successfully test the algorithm against two world champion go programs. The article appears to be most useful for go programmers looking for an algorithm to identify and predict fights. Path: GiveMeLiberties · Prev: SemeaiDiscussion · Next: CountingLiberties This is a copy of the living page "Go Research on Semeai" at Sensei's Library. ![]() |