Talk:Benson's algorithm (Go)

This article is rated Stub-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects:

Go Low‑importance This article is within the scope of WikiProject Go, a collaborative effort to improve the coverage of the game of Go on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.GoWikipedia:WikiProject GoTemplate:WikiProject GoGo Low This article has been rated as Low-importance on the importance scale. Mathematics Start‑class Low‑priority This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics Start This article has been given a rating which conflicts with the project-independent quality rating in the banner shell. Please resolve this conflict if possible. Low This article has been rated as Low-priority on the project's priority scale.

The article mentions "Most strong Computer Go programs since 2008 do not actually use Benson's algorithm." But the KataGo paper mentions it uses "Self-play games used Tromp-Taylor rules [21] modified to not require capturing stones within pass-aliveterritory4" In a footnote it is clarified they use Benson's algorithm to establish pass alive groups. Is the Wikipedia article wrong?

Fejfo (talk) 23:50, 19 July 2022 (UTC)[reply]