Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Proposal and analysis of stochastic variants of Quantum Tic-tac-toe

作田 誠, 冨岡 佑成

Published Sep 1, 2017• 0 citations
OpenAlex

Abstract

The stochastic variants of Quantum Tic-tac-toe are proposed as more quantum-mechanical metaphor, and the theoretical outcomes as expected values are computed with a stochastic modification of the alpha-beta search. The outcomes vary from complete win to draw with increasing the advantageous probability for the second player. In addition, new zero-sum scoring with a positive score for the second player in a drawn game is introduced and analyzed. The results show the outcome becomes zero when the advantageous probability is around 0.75,which is considered as the evenly-matched interesting settings. Finally, the availability of playing system of the variants is shown.

Related papers

Strategic insights from playing quantum tic-tac-toe

J N Leaw, S A Cheong

In this paper, we perform a minimalistic quantization of the classical game of tic-tac-toe, by allowing superpositions of classical moves. In order for the quantum game to reduce properly to the classical game, we require legal quantum moves to be orthogonal to all previous moves. We also admit interference effects, by squaring the sum of amplitudes over all moves by a player to compute his or her occupation level of a given site. A player wins when the sum of occupations along any of the eight straight lines we can draw in the 3 × 3 grid is greater than or equal to 3. We play the quantum tic-tac-toe first randomly, and then deterministically, to explore the impact different opening moves, end games and different combinations of offensive and defensive strategies have on the outcome of the game. In contrast to the classical tic-tac-toe, the deterministic quantum game does not always end in a draw. In contrast also to most classical two-player games of no chance, it is possible for player 2 to win. More interestingly, we find that player 1 enjoys an overwhelming quantum advantage when he opens with a quantum move, but loses this advantage when he opens with a classical move. We also find the quantum blocking move, which consists of a weighted superposition of moves that the opponent could use to win the game, to be very effective in denying the opponent his or her victory. We then speculate what implications these results might have on quantum information transfer and portfolio optimization.

arXiv:1007.3601•Journal of Physics A Mathematical and Theoretical•Oct 20, 2010•14 citations

Quantum Tic-Tac-Toe: A Genuine Probabilistic Approach

Marius Nagy, Naya Nagy

We propose a quantum version of Tic-Tac-Toe which accurately reflects the inherent probabilistic nature of the measurement principle in quantum mechanics. We then formulate a quantum strategy which allows a quantum player to consistently win over a classical player, with a certain probability. This result can be seen as another proof of the superior computational power of a quantum system with respect to a classical one. Our investigation also reveals that the non-determinism and complexity introduced by the principles of quantum mechanics into even the most simple games make brute-force strategies considerably more difficult to implement. Consequently, games in which machines have gained the upper hand over humans may be made fair again by upgrading them to a quantum level.

Applied Mathematics•Jan 1, 2012•4 citations

Toward Quantum Combinatorial Games

Paul Dorbec, Mehdi Mhalla

In this paper, we propose a Quantum variation of combinatorial games, generalizing the Quantum Tic-Tac-Toe proposed by Allan Goff. A combinatorial game is a two-player game with no chance and no hidden information, such as Go or Chess. In this paper, we consider the possibility of playing superpositions of moves in such games. We propose different rulesets depending on when superposed moves should be played, and prove that all these rulesets may lead similar games to different outcomes. We then consider Quantum variations of the game of Nim. We conclude with some discussion on the relative interest of the different rulesets.

arXiv:1701.02193•Electronic Proceedings in Theoretical Computer Science•Feb 27, 2018•6 citations

Quantum combinatorial games

Dieks Scholten, Bram Westerbaan, Simona Samardjiska

A combinatorial game is a deterministic game with no hidden information played between two opponents such as tic-tac-toe, checkers or chess. In this paper we extend combinatorial games to the quantum setting, by first revisiting and reformulating existing theory of classical combinatorial games. We investigate in which case a quantum opponent has an advantage over a classical one. Surprisingly, our instantiation of Zermelo's classical theorem in the quantum setting shows that the effects of quantum mechanics do not convey an advantage against a classical player that plays a perfect classical strategy. In a more realistic scenario, when the classical player makes mistakes, we show how the quantum opponent can amplify the mistake to increase their chance of winning. Our theory has application beyond the mere playing of board games and can be used as a tool in finite deterministic adversarial models with perfect information.

arXiv:2607.06550•Jul 7, 2026•0 citations

Quantum tic-tac-toe: A teaching metaphor for superposition in quantum mechanics

Allan Goff

Quantum tic-tac-toe was developed as a metaphor for the counterintuitive nature of superposition exhibited by quantum systems. It offers a way of introducing quantum physics without advanced mathematics, provides a conceptual foundation for understanding the meaning of quantum mechanics, and is fun to play. A single superposition rule is added to the child’s game of classical tic-tac-toe. Each move consists of a pair of marks subscripted by the number of the move (“spooky” marks) that must be placed in different squares. When a measurement occurs, one spooky mark becomes real and the other disappears. Quantum tic-tac-toe illustrates a number of quantum principles including states, superposition, collapse, nonlocality, entanglement, the correspondence principle, interference, and decoherence. The game can be played on paper or on a white board. A Web-based version provides a refereed playing board to facilitate the mechanics of play, making it ideal for classrooms with a computer projector.

American Journal of Physics•Oct 18, 2006•68 citations

Entangling Tic-Tac-Toe: Quantum TTT Revisited

Nicolas Hipolito, Jennifer F. Vasquez

Can one learn about quantum mechanics while playing tic-tac-toe? You bet. While studying the axioms of quantum mechanics, we came across a variant of tic-tac-toe designed to help students understan...

Math Horizons•Sep 4, 2025•0 citations
The stochastic variants of Quantum Tic-tac-toe are proposed as more quantum-mechanical metaphor, and the theoretical outcomes as expected values are computed with a stochastic modification of the alpha-beta search. The outcomes vary from complete win to draw with increasing the advantageous probability for the second player. In addition, new zero-sum scoring with a positive score for the second player in a drawn game is introduced and analyzed. The results show the outcome becomes zero when the advantageous probability is around 0.75,which is considered as the evenly-matched interesting settings. Finally, the availability of playing system of the variants is shown.
In this paper, we perform a minimalistic quantization of the classical game of tic-tac-toe, by allowing superpositions of classical moves. In order for the quantum game to reduce properly to the classical game, we require legal quantum moves to be orthogonal to all previous moves. We also admit interference effects, by squaring the sum of amplitudes over all moves by a player to compute his or her occupation level of a given site. A player wins when the sum of occupations along any of the eight straight lines we can draw in the 3 × 3 grid is greater than or equal to 3. We play the quantum tic-tac-toe first randomly, and then deterministically, to explore the impact different opening moves, end games and different combinations of offensive and defensive strategies have on the outcome of the game. In contrast to the classical tic-tac-toe, the deterministic quantum game does not always end in a draw. In contrast also to most classical two-player games of no chance, it is possible for player 2 to win. More interestingly, we find that player 1 enjoys an overwhelming quantum advantage when he opens with a quantum move, but loses this advantage when he opens with a classical move. We also find the quantum blocking move, which consists of a weighted superposition of moves that the opponent could use to win the game, to be very effective in denying the opponent his or her victory. We then speculate what implications these results might have on quantum information transfer and portfolio optimization.
We propose a quantum version of Tic-Tac-Toe which accurately reflects the inherent probabilistic nature of the measurement principle in quantum mechanics. We then formulate a quantum strategy which allows a quantum player to consistently win over a classical player, with a certain probability. This result can be seen as another proof of the superior computational power of a quantum system with respect to a classical one. Our investigation also reveals that the non-determinism and complexity introduced by the principles of quantum mechanics into even the most simple games make brute-force strategies considerably more difficult to implement. Consequently, games in which machines have gained the upper hand over humans may be made fair again by upgrading them to a quantum level.
In this paper, we propose a Quantum variation of combinatorial games, generalizing the Quantum Tic-Tac-Toe proposed by Allan Goff. A combinatorial game is a two-player game with no chance and no hidden information, such as Go or Chess. In this paper, we consider the possibility of playing superpositions of moves in such games. We propose different rulesets depending on when superposed moves should be played, and prove that all these rulesets may lead similar games to different outcomes. We then consider Quantum variations of the game of Nim. We conclude with some discussion on the relative interest of the different rulesets.
A combinatorial game is a deterministic game with no hidden information played between two opponents such as tic-tac-toe, checkers or chess. In this paper we extend combinatorial games to the quantum setting, by first revisiting and reformulating existing theory of classical combinatorial games. We investigate in which case a quantum opponent has an advantage over a classical one. Surprisingly, our instantiation of Zermelo's classical theorem in the quantum setting shows that the effects of quantum mechanics do not convey an advantage against a classical player that plays a perfect classical strategy. In a more realistic scenario, when the classical player makes mistakes, we show how the quantum opponent can amplify the mistake to increase their chance of winning. Our theory has application beyond the mere playing of board games and can be used as a tool in finite deterministic adversarial models with perfect information.
Quantum tic-tac-toe was developed as a metaphor for the counterintuitive nature of superposition exhibited by quantum systems. It offers a way of introducing quantum physics without advanced mathematics, provides a conceptual foundation for understanding the meaning of quantum mechanics, and is fun to play. A single superposition rule is added to the child’s game of classical tic-tac-toe. Each move consists of a pair of marks subscripted by the number of the move (“spooky” marks) that must be placed in different squares. When a measurement occurs, one spooky mark becomes real and the other disappears. Quantum tic-tac-toe illustrates a number of quantum principles including states, superposition, collapse, nonlocality, entanglement, the correspondence principle, interference, and decoherence. The game can be played on paper or on a white board. A Web-based version provides a refereed playing board to facilitate the mechanics of play, making it ideal for classrooms with a computer projector.