Simultaneous Go via quantum collapse
Yasha Savelyev

TL;DR
This paper introduces a simplified, deterministic quantum-inspired version of the game Go, called SGo, which maintains strategic complexity and exhibits a mixed equilibrium strategy for draws.
Contribution
It presents SGo, a symmetric, deterministic, quantum-inspired adaptation of Go, removing traditional rules and demonstrating equilibrium strategies.
Findings
SGo has a mixed equilibrium strategy for draws.
SGo simplifies traditional Go while preserving key dynamics.
Deterministic quantum state reduction enables move sensitivity.
Abstract
We construct a symmetric, simultaneous, deterministic evolution game , which is in a certain mathematical sense a symmetrization of the classical board game Go. is in some ways a simpler game than Go, as Komi, Ko and suicide rules are removed. On the other hand it has similar dynamics and move sensitivity, enabled by certain deterministic ``quantum state'' reduction, so that state evolution is deterministic. Using the argument of Nash, we show that has a mixed equilibrium strategy to draw on average.
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
TopicsQuantum Mechanics and Applications · Quantum Information and Cryptography · Quantum Computing Algorithms and Architecture
