Combinatorics of Go

By John Tromp, Gunnar Farnebäck. 2006

99 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Evaluation & Benchmarks

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Geoffrey Irving
2. Paul Christiano
3. Dario Amodei
4. Neil Burch
5. Sergey Levine
6. Jan Leike
7. Quoc V. Le
8. Pieter Abbeel

In Evaluation & Benchmarks

1. Geoffrey Irving
2. Neil Burch

Citations in the corpus

• AI safety via debate (2018, background): “3 Debate is self play Debate is a competitive game between agents, and inherits the advantages of multiagent competition: 4Go is an example of a game with deep unimportant paths: it is extremely rare for a professional game to last more than 400 moves, but Tromp and Farnebäck [2006] construct artifi”
• Neural Approaches to Conversational AI (2018, neutral): “For instance, the number of states in the game of Go is larger than 2 × 10 (Tromp and Farnebäck, 2006).”
• Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search (2006, unknown): “When played on a 9 × 9 grid, the complexity of the game of Go, in terms of the number of legal positions, is inferior to the complexity of the game of chess [2, 27], and the number of legal moves per position is similar.”
• Time and Space: Why Imperfect Information Games are Hard (2018, methodology): “Using algorithms which rely on decomposition(1) we have seen super-human play in games like chess (with 10(40)-10(50) reachable states [78]) and recently in the game of go [81] (with somewhat less than 10(171) reachable states [86].”