Benson's algorithm (Go)
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.
- Comment
- enIn 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.
- Has abstract
- enIn 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.
- Is primary topic of
- Benson's algorithm (Go)
- Label
- enBenson's algorithm (Go)
- Link from a Wikipage to an external page
- webdocs.cs.ualberta.ca/~games/go/seminar/2002/020717/benson.pdf%7Cformat=pdf%7Caccessdate=March
- Link from a Wikipage to another Wikipage
- Benson's algorithm
- Category:Computer Go
- Computer Go
- Go (game)
- Go and mathematics
- God's algorithm
- Go strategy and tactics
- Linear programming
- Multi-objective optimization
- Without loss of generality
- SameAs
- 4XkVC
- m.0j64bf7
- Q4890228
- Subject
- Category:Computer Go
- WasDerivedFrom
- Benson's algorithm (Go)?oldid=1095740828&ns=0
- WikiPageLength
- 3363
- Wikipage page ID
- 35169884
- Wikipage revision ID
- 1095740828
- WikiPageUsesTemplate
- Template:Cite journal
- Template:Distinguish
- Template:Go (game)
- Template:GoBoardGame
- Template:Reflist
- Template:Short description