On the number of go positions on lattice graphs

DOI10.1016/j.ipl.2007.08.018zbMath1185.68454OpenAlexW1963489411MaRDI QIDQ2380058

Johannes Schmidt, Graham E. Farr

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.08.018

zbMATH Keywords

combinatorial enumerationcombinatorial problemstransfer matricesgameslattice graphsgo

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics in computer science (68R05)

Related Items (2)

Counting Domineering Positions ⋮ The Polynomial Profile of Distance Games on Paths and Cycles

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Go polynomials of a graph.
• The Complexity of Enumeration and Reliability Problems
• GO Is Polynomial-Space Hard
• Colouring Square Lattice Graphs
• Combinatorics of Go
• Computer Go

This page was built for publication: On the number of go positions on lattice graphs