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]