On the number of Go positions on lattice graphs

We use transfer matrix methods to determine bounds for the numbers of legal Go positions for various numbers of players on some planar lattice graphs, including square lattice graphs such as those on which the game is normally played. We also find bounds on limiting constants that describe the behaviour of the number of legal positions on these lattice graphs as the dimensions of the lattices tend to infinity. These results amount to giving bounds for some specific evaluations of Go polynomials on these graphs.

• Type: Journal
• Year: 2008
• Where: IPL
• Authors: Graham Farr, Johannes Schmidt
• Keywords: IPL 2008, Lattice Graphs, Planar Lattice Graphs, Square Lattice Graphs