Benson's algorithm (Go)
| Part of a series on |
| Go |
|---|
 |
| Game specifics |
|
| History and culture |
| Players and organizations |
| Computers and mathematics |
In the game Go, Benson's algorithm (named after David B. Benson) can be used to determine the stones which are safe from capture no matter how many turns in a row the opposing player gets, i.e. unconditionally alive.[1]
Algorithm
[edit]Without loss of generality, we describe Benson's algorithm for the Black player.
Let X be the set of all Black chains and R be the set of all Black-enclosed regions of X. Then Benson's algorithm requires iteratively applying the following two steps until neither is able to remove any more chains or regions:
- Remove from X all Black chains with less than two vital Black-enclosed regions in R, where a Black-enclosed region is vital to a Black chain in X if all its empty intersections are also liberties of the chain.
- Remove from R all Black-enclosed regions with a surrounding stone in a chain not in X.
The final set X is the set of all unconditionally alive Black chains.[2]
Applicability
[edit] |
Most strong Computer Go programs since 2008 do not actually use Benson's algorithm. "Knowledge-based" approaches to Go that attempt to simulate human strategy proved to not be very effective, and later approaches generally used tools such as Monte Carlo random playouts to "score" positions.[3] Go positions frequently require scoring stones and territory in a more probabilistic, gradual manner where stones might be probably dead unless the opponent allows the player to make uncontested plays to save the stones, contested, alive as long as the opponent is not allowed one uncontested play, alive as long as the opponent is not allowed repeated uncontested play in the area, and so on. A system that only perceives unconditionally alive will not be very strong, as high-level play routinely involves leaving groups not entirely "finished" after their state becomes safe if protected by further plays (e.g. they will only be captured if the player lets them be captured, in which case they are presumably trading them for an even higher value objective). A system that can handle more complicated gradients of possibility will already understand unconditionally alive stones "for free" as part of whatever system is used to score and understand positions.
See also
[edit]References
[edit]- ^ Tapani Raiko (May 5, 2005). "Benson's algorithm". Retrieved March 21, 2012.
- ^ "Sensei's Library: Benson's Definition of Unconditional Life". Retrieved March 21, 2012.
- ^ Steinmetz, E. S., & Gini, M. G. (2015). Mining Expert Play to Guide Monte Carlo Search in the Opening Moves of Go [Digital]. In International Joint Conference on Artificial Intelligence, Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015) (24th ed.). International Joint Conference on Artificial Intelligence. https://www.ijcai.org/Proceedings/15/Papers/118.pdf
- David B. Benson (1976). "Life in the game of Go" (PDF). Information Sciences. 10 (2). Elsevier: 17–29. doi:10.1016/s0020-0255(76)90554-5. Retrieved March 21, 2012.
