On the number of go positions on lattice graphs

DOI10.1016/J.IPL.2007.08.018MaRDI QIDQ2380058zbMATH OpenOpenAlexFDO

Authors Johannes Schmidt, Graham 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 problemsgamesgolattice graphstransfer matrices

Mathematics Subject Classification ID

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

Recommendations

• Combinatorics of Go
• The probabilistic method meets Go
• The number of legal Go positions
• The Go polynomials of a graph.
• Formulations of patterns by a graph model for the game of Go

Cites work

• Colouring Square Lattice Graphs
• Combinatorics of Go
• Computer Go
• GO Is Polynomial-Space Hard
• scientific article; zbMATH DE number 437298 (Why is no real title available?)
• scientific article; zbMATH DE number 3856167 (Why is no real title available?)
• scientific article; zbMATH DE number 3954959 (Why is no real title available?)
• scientific article; zbMATH DE number 51878 (Why is no real title available?)
• scientific article; zbMATH DE number 598464 (Why is no real title available?)
• The Complexity of Enumeration and Reliability Problems
• The Go polynomials of a graph.

Cited in

(7)

• The number of legal Go positions
• Counting domineering positions
• The polynomial profile of distance games on paths and cycles
• The probabilistic method meets Go
• Combinatorics of Go
• Nakade -- a graph theoretic concept in Go
• Graph polynomials: some questions on the edge

Describes a project that uses

Uses Software

• Matlab

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380058)