Unraveling Go gaming nature by Ising Hamiltonian and common fate graphs: tactics and statistics
Didier Barradas-Bautista, Mat\'ias Alvarado

TL;DR
This paper models the complex dynamics of Go using an Ising Hamiltonian approach, revealing insights into strategic patterns and stochastic evolution beyond current AI capabilities.
Contribution
It introduces a novel Ising model framework to analyze Go game dynamics, capturing long-term strategies and pattern formations in a way that surpasses existing AI understanding.
Findings
Model accurately predicts game scores
Identifies formation of strategic patterns
Reveals differences between human and AI tactics
Abstract
Go gaming is a struggle between adversaries, black and white simple stones, and aim to control the most Go board territory for success. Rules are simple but Go game fighting is highly intricate. Stones placement and interaction on board is random-appearance, likewise interaction phenomena among basic elements in physics thermodynamics, chemistry, biology, or social issues. We model the Go game dynamic employing an Ising model energy function, whose interaction coefficients reflect the application of rules and tactics to build long-term strategies. At any step of the game, the energy function of the model assesses the control and strength of a player over the board. A close fit between predictions of the model with actual game's scores is obtained. AlphaGo computer is the current top Go player, but its behavior does not wholly reveal the Go gaming nature. The Ising function allows for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsArtificial Intelligence in Games · Reinforcement Learning in Robotics · Evolutionary Algorithms and Applications
