We introduce a new board game based on the ancient Chinese game of Go (Weiqi, Igo, Baduk). The key difference from the original game is that players no longer alternatively play single stones on the board but instead they take turns placing pairs of entangled go stones. A phenomenon of quantum-like collapse occurs when one of the stones in an entangled pair is directly in contact with at least one other stone. The player to whom the entangled pair belongs must then remove one of the stones in the pair from the board. The aim of the game is still to surround more territory than the opponent and as the number of stones increases, all the entangled pairs of stones eventually reduce to single stones. Quantum Go provides an interesting and tangible illustration of quantum concepts such as superposition, entanglement and collapse.
We introduce a new board game based on the ancient Chinese game of Go (Weiqi, Igo, Baduk). The key difference from the original game is that players no longer alternatively play single stones on the board but instead they take turns placing pairs of entangled go stones. A phenomenon of quantum-like collapse occurs when one of the stones in an entangled pair is directly in contact with at least one other stone. The player to whom the entangled pair belongs must then remove one of the stones in the pair from the board. The aim of the game is still to surround more territory than the opponent and as the number of stones increases, all the entangled pairs of stones eventually reduce to single stones. Quantum Go provides an interesting and tangible illustration of quantum concepts such as superposition, entanglement and collapse.
The strategic Go game, known for the tedious mathematical complexities, has been used as a theme in many fiction, movies, and books. Here, we introduce the Go game and provide a new version of quantum Go in which the boxes are initially in a superposition of quantum states |0> and |1> and the players have two kinds of moves (classical and quantum) to mark each box. The mark on each box depends on the state to which the qubit collapses after the measurement. All other rules remain the same, except for here, we capture only one stone and not chains. Due to the enormous power and exponential speed-up of quantum computers as compared to classical computers, we may think of quantum computing as the future. So, here we provide a tangible introduction to superposition, collapse, and entanglement via our version of quantum Go. Finally, we compare the classical complexity with the quantum complexity involved in playing the Go game.
Abstract Go has long been considered as a testbed for artificial intelligence. By introducing certain quantum features, such as superposition and collapse of wavefunction, we experimentally demonstrate a quantum version of Go by using correlated photon pairs entangled in polarization degree of freedom. The total dimension of Hilbert space of the generated states grows exponentially as two players take turns to place the stones in time series. As nondeterministic and imperfect information games are more difficult to solve using nowadays technology, we excitedly find that the inherent randomness in quantum physics can bring the game nondeterministic trait, which does not exist in the classical counterpart. Some quantum resources, like coherence or entanglement, can also be encoded to represent the state of quantum stones. Adjusting the quantum resource may vary the average imperfect information (as comparison classical Go is a perfect information game) of a single game. We further verify its non-deterministic feature by showing the unpredictability of the time series data obtained from different classes of quantum state. Finally, by comparing quantum Go with a few typical games that are widely studied in artificial intelligence, we find that quantum Go can cover a wide range of game difficulties rather than a single point. Our results establish a paradigm of inventing new games with quantum-enabled difficulties by harnessing inherent quantum features and resources, and provide a versatile platform for the test of new algorithms to both classical and quantum machine learning.
Go has long been considered as a testbed for artificial intelligence. By introducing certain quantum features, such as superposition and collapse of wavefunction, we experimentally demonstrate a quantum version of Go by using correlated photon pairs entangled in polarization degree of freedom. The total dimension of Hilbert space of the generated states grows exponentially as two players take turns to place the stones in time series. As nondeterministic and imperfect information games are more difficult to solve using nowadays technology, we excitedly find that the inherent randomness in quantum physics can bring the game nondeterministic trait, which does not exist in the classical counterpart. Some quantum resources, like coherence or entanglement, can also be encoded to represent the state of quantum stones. Adjusting the quantum resource may vary the average imperfect information (as comparison classical Go is a perfect information game) of a single game. We further verify its non-deterministic feature by showing the unpredictability of the time series data obtained from different classes of quantum state. Finally, by comparing quantum Go with a few typical games that are widely studied in artificial intelligence, we find that quantum Go can cover a wide range of game difficulties rather than a single point. Our results establish a paradigm of inventing new games with quantum-enabled difficulties by harnessing inherent quantum features and resources, and provide a versatile platform for the test of new algorithms to both classical and quantum machine learning.
Recently the concept of quantum information has been introduced into game theory. Here we present the first study of quantum games with more than two players. We discover that such games can possess an alternative form of equilibrium strategy, one which has no analog either in traditional games or even in two-player quantum games. In these ``coherent'' equilibria, entanglement shared among multiple players enables different kinds of cooperative behavior: indeed it can act as a contract, in the sense that it prevents players from successfully betraying one another.
.Quantum Tic Tac Toe is an innovative twist on the classic game of Tic Tac Toe, inspired by principles of quantum mechanics such as superposition and entanglement. Unlike the traditional version, where players place definite marks (X or O), this quantum version allows players to place entangled moves that can exist in multiple states simultaneously until a collapse occurs. The game introduces unique gameplay mechanics such as quantum moves, entangled states, and wave function collapse, making it both a learning tool and an entertaining experience. The project was developed using Python and integrated with a graphical user interface using Kivy, allowing for intuitive interaction and seamless gameplay. It supports features like reset, collapse, theme switching, and automatic cycle detection. These functionalities reflect core quantum concepts through visual and interactive methods, making the game suitable for both educational and recreational use. The system architecture includes modules for input handling, entanglement logic, quantum state tracking, and user interface. By abstracting quantum behavior into game logic, this project demonstrates how complex scientific ideas can be represented through playful and accessible software design. Index Terms :Quantum Computing, Superposition, Entanglement, Python, Kivy, Game Design, Cycle Detection, Quantum Collapse.