Pith. sign in

REVIEW 3 major objections 5 minor 24 references

Quantum Checkers: The Development and Analysis of a Quantum Combinatorial Game

T0 review · 3 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Quantum checkers layers superposition, measurement, entanglement, and interference onto English draughts in four cumulative levels, and initial experiments show it can serve as a tunable benchmark for quantum-game AI.

desk verdict A well-specified, open-source quantum checkers game whose complexity claims rest on a probabilistic shortcut for level 2 that should be flagged. read the letter →

arxiv 2506.05962 v2 pith:DQZAG64M submitted 2025-06-06 quant-ph

Marien Raat , Luuk van den Nouweland , Matthias Müller-Brockhausen , Mike Preuss , Evert van Nieuwenburg This is my paper
classification quant-ph
keywords quantumgamecombinatorialcheckerssuperpositionentanglementinterferenceMonteCarlotreesearchcomplexity
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper develops Cheqqers, a quantum version of English draughts in which every square is a qubit that records whether it is occupied. New legal moves let a piece split into a superposition across two squares, let captures entangle the capturer with the captured piece, and let separated parts of one piece merge and interfere. The rules are added in levels, so level 0 is exactly classical checkers and each higher level adds one quantum concept while keeping all earlier moves legal. The authors claim this creates a framework that interpolates between a solved classical game and a genuinely quantum one, useful both as a benchmark for AI agents learning quantum games and as a way for human players to build intuition for quantum phenomena. Initial experiments with random and Monte Carlo Tree Search agents measure game length, draw rates, and agent skill, showing that adding quantum moves lengthens games and increases draws while remaining winnable by search-based AI.

What carries the argument

The load-bearing mechanism is the square-as-qubit encoding paired with a small set of unitary move operators. Each square is a qubit whose $|1\rangle$ state means occupied, so the whole board is a 64-qubit register; the implementation tracks only the connected subsets of squares that are in superposition and builds a minimal circuit at measurement time. The split move is the square-root-iSWAP operator, $|100\rangle \to \frac{1+i}{2}|010\rangle + \frac{1-i}{2}|001\rangle$, and the merge move is its inverse, so phase rotations acquired during intervening moves determine whether merging reconstructs the original piece or leaves probability on the source squares. This operator-based design is what lets measurement, entanglement, and interference appear as legal moves rather than as bookkeeping.

What would settle it

Simulate a set of level 2 games exactly with a full state-vector circuit on a $10\times10$ board, or on a $6\times6$ board with many seeds to keep it feasible, and compare the average game length and draw rate to the paper's probabilistic-simulation values; if entangled correlations shift capture probabilities enough to change draw rates, the reported complexity trend for large boards is not the true one.

Watch

Extended reading notes

Core claim

The paper's central claim is that a board game can carry genuine quantum mechanics, not just random chance, by encoding the board as qubits and defining legal moves as unitary operations. In Cheqqers, a split move applies the square-root-iSWAP gate, sending an occupied source square into an equal superposition over two target squares; a capture of a superposed piece at level 1 triggers a measurement, while at level 2 it creates an entangled state correlating the capturer's position with whether the capture happened; at level 3 a merge move, the inverse of split, lets overlapping parts interfere through accumulated phase rotations. Because classical moves remain legal at every level, the quantum state space contains the classical game and the added rules strictly enlarge it. The authors' experiments support the claim by showing the quantum levels behave differently in measurable ways, with longer games, more draws, and lower MCTS dominance as quantumness increases, which is the controlled complexity progression a benchmark needs.

Load-bearing premise

The quantitative story about game length and draw rates on boards larger than $8\times8$ rests on probabilistic simulations that treat entangled pieces as independent, so level 2 results ignore correlations that the true quantum state would produce.

Editorial extensions

If this is right

  • Classical checkers strategies remain fully available at every level, so any improvement in quantum play is an addition over, not a replacement of, classical strategy.
  • Because split pieces reduce the chance that an attempted capture succeeds, higher quantumness levels make games longer and more draw-prone under the 40-move rule.
  • Monte Carlo Tree Search agents beat random agents at every level, but their edge narrows as quantumness increases, suggesting measurement randomness masks small skill differences.
  • The four-level design gives a built-in difficulty knob for benchmarking: the same code base can interpolate from solved classical checkers to a game with entanglement and interference.
  • Because the implementation is circuit-based, the game logic is in principle portable to a real quantum computer, not just a classical simulation.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Extension beyond the paper: the same square-as-qubit encoding and split-and-merge operators could be transplanted to other classical board games, letting researchers compare how different game geometries shape quantum complexity.
  • Extension beyond the paper: the level-2 probabilistic approximation used for large boards is a testable gap; exact small-board simulation could either validate the reported trends or show that entanglement changes them.
  • Extension beyond the paper: the interface currently shows occupancy probabilities but not relative phases, so level-3 interference is only implicit for human players; a phase overlay would directly test whether players can build intuition for interference.
  • Extension beyond the paper: a controlled study measuring players' quantum-intuition gains after playing Cheqqers versus a non-quantum control would test the paper's educational motivation, which the current experiments do not address.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper introduces Cheqqers, a quantum variant of checkers with four levels of quantumness: classical, superposition/measurement, entanglement, and interference. It specifies the rules for each level, describes an open-source Python/cirq implementation and a web frontend, and reports experiments using random and Monte Carlo Tree Search (MCTS) agents to measure game length, draw rates, MCTS win rates, and TrueSkill ratings. The advertised contributions are a playable educational quantum game and a benchmark for AI agents learning to play quantum games.

Significance. If the results hold, this is a useful contribution: a clearly specified, open-source quantum combinatorial game with a progressive level-based design that is well suited for education and for benchmarking AI agents. The paper includes a concrete implementation with a public code repository, which supports reproducibility, and the MCTS/random-agent comparisons provide a starting point for future work. The central quantitative complexity trends are, however, currently provisional because the larger-board results for the entangled level rely on a probabilistic approximation that discards the correlations that define the level.

major comments (3)
  1. [Section VI-A, Fig. 7] The load-bearing quantitative claim that the quantum versions have longer average games and higher draw rates is not established for level 2 at larger board sizes. The caption states that quantum behavior for level 1 and 2 without draws was 'simulated probabilistically' from size 12x12 and 10x10, respectively. For level 2, a probabilistic simulation that tracks only marginal occupation probabilities discards the entanglement correlations that distinguish level 2 from level 1, and game length and draw rate are exactly the observables where such correlations matter because capture attempts on entangled pieces branch on joint states. Please either provide exact full-state simulations at these board sizes or explicitly restrict the claims in Section VI-A and the Abstract to sizes where exact simulation is available; in the latter case, the 'framework for interpolating' claim should be softened.
  2. [Section VI-C, Fig. 10] The claim that the same TrueSkill trend is observed on the standard 8x8 board rests on only 48 games per agent (96 matches total). The paper itself notes that the sigma values are higher due to the larger game tree and fewer games, so the differences between MCTS agents and the random agent may not be statistically meaningful. Add confidence intervals on the TrueSkill ratings, report a significance test, or increase the number of games before using this result as evidence for the benchmark claim.
  3. [Section VII] The concluding statement that the experiments 'demonstrate that quantum moves can be advantageous' is not supported by the reported experiments. The experiments compare MCTS agents against a random agent but do not isolate the effect of quantum moves, for example by having the same agent play with and without access to quantum moves or by analyzing which quantum moves lead to wins. Rephrase this as a suggestion for future work or add a direct comparison that supports the claim.
minor comments (5)
  1. [Fig. 7 caption] The phrase 'up from size' should be 'from size', and the caption should clarify which subplots use exact simulation and which use the probabilistic approximation, since the current wording only mentions the without-draw case.
  2. [Section III-A] The text says 'we will consider varying board sizes smaller than 8x8', but Section VI reports experiments on boards up to 14x14; the wording should be updated to match the actual experimental range.
  3. [Fig. 8] No error bars or confidence intervals are shown for the 100-game win percentages; adding them would make the comparison more informative.
  4. [Appendix] The split move is clearly defined, but the merge move description should state how the accumulated phases from intermediate classical moves enter the inverse operation, since this is essential for reproducing the interference behavior.
  5. [Reference [10]] The TiqTaqToe reference is given only as a URL; a formal citation with title, author, and year would be more useful to readers.

Circularity Check

0 steps flagged · score 2.0 of 10

No circular derivation; the only self-citation (TiqTaqToe) is a non-load-bearing design inspiration, not an evidence source.

full rationale

The paper does not derive any claimed result from a quantity that is defined in terms of the result. Its central outputs are the rule set for Cheqqers and three empirical measurements: random-agent game length and draw rate (Fig. 7), MCTS win rates (Fig. 8), and TrueSkill ratings (Figs. 9-10). These are produced by the authors' own Cirq-based implementation and are not fitted parameters renamed as predictions; no equation in the paper equates a target observable to an input by construction. The one self-citation is to TiqTaqToe [10] ('we follow the design of TiqTaqToe and incorporate different levels of quantum checkers'), but this concerns only the pedagogical level structure and carries no evidential weight for the complexity or AI results, which would stand identically without that citation. The probabilistic simulation for large level-1/2 boards is a computational approximation and a genuine validity limitation (the caption admits level 3 cannot be simulated this way), but an approximation is not circularity: it does not presuppose the game-length or draw-rate trends it reports. No uniqueness theorem, ansatz, or known result is smuggled in via self-citation, and the game is its own object of study. The score of 2 reflects the single minor, non-load-bearing self-citation rather than any circular step.

Assumptions & free parameters 4 free parameters · 5 assumptions · 0 invented entities

The paper introduces new game mechanics (split pieces, entangled pieces, merge moves) but no new physical entities, forces, or particles. The free parameters are all standard algorithmic or rule choices, none fitted to data in a way that would make a prediction circular.

free parameters (4)
  • MCTS exploration constant c = sqrt(2)
    Chosen by the authors, not fitted; standard for UCT in Monte Carlo tree search.
  • MCTS rollout budgets = 200, 400, 800
    Three budgets define the low, medium, and high agents; arbitrary choices that affect performance comparisons.
  • TrueSkill prior = mu=25, sigma=25/3
    Default initial rating parameters in TrueSkill; not fitted to data.
  • 40-move draw threshold = 40
    Standard rule from English draughts; directly affects measured game lengths and draw rates in Experiment 1.
assumptions (5)
  • domain assumption Each board square is a qubit tracking occupancy; piece type and color are tracked separately.
    States the representation chosen for the game; the authors note that a 5-state qudit approach is possible but not attempted (Section III).
  • ad hoc to paper Split move is implemented with the square-root-iSWAP operator.
    Defines the quantum gate used for splitting a piece; adopted directly from Quantum Chess (Appendix).
  • ad hoc to paper Merge move is the inverse of the split operator.
    Design choice that makes immediate re-merging deterministic and produces interference effects (Section III-D).
  • ad hoc to paper Every classical and quantum move applies a phase rotation.
    Phase rotations are added so that interference is possible in level 3; without them, merge moves would not redistribute probabilities (Appendix).
  • domain assumption Classical moves remain legal at all quantum levels.
    Follows 'quantum flavor D' from Burke et al.; ensures the game is a superset of classical checkers (Section II).

how reviews work

0 comments
Cite this review

Pith. "Pith review of Quantum Checkers: The Development and Analysis of a Quantum Combinatorial Game." pith.science (2026). https://pith.science/paper/DQZAG64M

@misc{pith2026250605962,
  author       = {Pith},
  title        = {Pith review of: Quantum Checkers: The Development and Analysis of a Quantum Combinatorial Game},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DQZAG64M}},
  note         = {Machine review of arXiv:2506.05962}
}
read the original abstract

This paper develops and analyses a novel quantum combinatorial game: quantum checkers (codenamed Cheqqers). The concepts of superposition, entanglement, measurements and interference from quantum mechanics are integrated into the game of checkers by adding new types of legal moves. The addition of these new rules is done gradually by introducing several levels of `quantumness'. Quantum checkers provides a framework for interpolating between a known and solved classical game and a more complex quantum game, and serves as 1) a benchmark for AI players learning to play quantum games and 2) an interesting game for human players that allows them to build intuition for quantum phenomena. We provide the initial analysis on the complexity of this game using random agents and a Monte Carlo tree search agent.

Figures

Figures reproduced from arXiv: 2506.05962 by the authors.

Figure 1
Figure 1. A normal move in classical checkers, where the piece moves either [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 3
Figure 3. A move where the white player moves their piece into superposition [PITH_FULL_IMAGE:figures/full_fig_p003_3.png] view at source ↗
Figure 2
Figure 2. A move where the white player takes a piece of the black player. [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figures from the paper (7 more)
Figure 5
Figure 5. Figure 5: A black piece tries to take an opponent’s piece in superposition. The [PITH_FULL_IMAGE:figures/full_fig_p004_5.png]
Figure 4
Figure 4. Figure 4: Two outcomes for a black piece trying to take a white piece in [PITH_FULL_IMAGE:figures/full_fig_p004_4.png]
Figure 6
Figure 6. Figure 6: A move where the white player moves their piece into superposition [PITH_FULL_IMAGE:figures/full_fig_p004_6.png]
Figure 7
Figure 7. Figure 7: The average game length of 1000 games between two random players [PITH_FULL_IMAGE:figures/full_fig_p006_7.png]
Figure 8
Figure 8. Figure 8: Win rate as percentage of MCTS agent against random agent both as [PITH_FULL_IMAGE:figures/full_fig_p006_8.png]
Figure 9
Figure 9. Figure 9: TrueSkill rating in each level for 150 games per agent over a total of [PITH_FULL_IMAGE:figures/full_fig_p007_9.png]
Figure 10
Figure 10. Figure 10: TrueSkill rating in each level for 48 games per agent over a total of [PITH_FULL_IMAGE:figures/full_fig_p007_10.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

24 extracted references · 18 canonical work pages

  1. [1]

    Quantum computational supremacy,

    A. W. Harrow and A. Montanaro, “Quantum computational supremacy,” Nature, vol. 549, no. 7671, pp. 203–209, 2017. [Online]. Available: https://www.nature.com/articles/nature23458

    work page 2017

  2. [2]

    The potential impact of quantum computers on society,

    R. de Wolf, “The potential impact of quantum computers on society,” Ethics and Information Technology, vol. 19, no. 4, pp. 271–276, 2017. [Online]. Available: https://doi.org/10.1007/s10676-017-9439-z

    work page doi:10.1007/s10676-017-9439-z 2017

  3. [3]

    Talking about public good for the second quantum revolution: analysing quantum technology narratives in the context of national strategies,

    T. Roberson, J. Leach, and S. Raman, “Talking about public good for the second quantum revolution: analysing quantum technology narratives in the context of national strategies,”Quantum Science and Technology, vol. 6, no. 2, p. 025001, 2021. [Online]. Available: https://dx.doi.org/10.1088/2058-9565/abc5ab

    work page doi:10.1088/2058-9565/abc5ab 2021

  4. [4]

    Computer games in education,

    R. E. Mayer, “Computer games in education,”Annual Review of Psychology, vol. 70, no. V olume 70, 2019, pp. 531–549, 2019. [Online]. Available: https://www.annualreviews.org/content/journals/10. 1146/annurev-psych-010418-102744

    work page 2019

  5. [5]

    The history of quantum games,

    L. J. Piispanen, E. Morrell, S. Park, M. Pfaffhauser, and A. Kultima, “The history of quantum games,” inProc. 2023 IEEE Conference on Games (CoG), 2023, pp. 1–8. [Online]. Available: https: //ieeexplore.ieee.org/abstract/document/10333150

    work page arXiv 2023

  6. [6]

    Defining quantum games,

    L. Piispanen, M. Pfaffhauser, J. Wootton, J. Togelius, and A. Kultima, “Defining quantum games,”EPJ Quantum Technology, vol. 12, no. 1, p. 7, 2025. [Online]. Available: https://doi.org/10.1140/epjqt/ s40507-025-00308-7

    doi:10.1140/epjqt/ 2025

  7. [7]

    Quantum Chess: Developing a Mathematical Framework and Design Methodology for Creating Quantum Games,

    C. Cantwell, “Quantum Chess: Developing a Mathematical Framework and Design Methodology for Creating Quantum Games,” Jul. 2019, unpublished. [Online]. Available: https://arxiv.org/abs/1906.05836

    arXiv 2019

  8. [8]

    The quantum chess story

    S. G. Akl, “The quantum chess story.”Int. J. Unconv. Comput., vol. 12, no. 2-3, pp. 207–219, 2016

    work page 2016

Show all 24 references
  1. [9]

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

    A. Goff, “Quantum tic-tac-toe: A teaching metaphor for superposition in quantum mechanics,”American Journal of Physics, vol. 74, no. 11, pp. 962–973, 11 2006. [Online]. Available: https://doi.org/10.1119/1. 2213635

    2006 doi

  2. [10]

    van Nieuwenburg

    E. van Nieuwenburg. (2019) Tiqtaqtoe.com. [Online]. Available: https://tiqtaqtoe.com/

    2019

  3. [11]

    Toward quantum combinatorial games,

    P. Dorbec and M. Mhalla, “Toward quantum combinatorial games,” inQuantum Physics and Logic, vol. 266, 2017, p. 237. [Online]. Available: https://hal.science/hal-01429072

    2017

  4. [12]

    Quantum Combinatorial Games: Structures and Computational Complexity,

    K. Burke, M. Ferland, and S.-H. Teng, “Quantum Combinatorial Games: Structures and Computational Complexity,” Nov. 2020, unpublished. [Online]. Available: https://arxiv.org/abs/2011.03704

    2020 arXiv

  5. [13]

    On the importance of being quantum,

    S. G. Akl, “On the importance of being quantum,”Parallel Processing Letters, vol. 20, no. 03, pp. 275–286, 2010. [Online]. Available: https://doi.org/10.1142/S0129626410000223

    2010 doi

  6. [14]

    Quantum computer games: quantum minesweeper,

    M. Gordon and G. Gordon, “Quantum computer games: quantum minesweeper,”Physics Education, vol. 45, no. 4, p. 372, jul 2010. [Online]. Available: https://dx.doi.org/10.1088/0031-9120/45/4/008

    2010 doi

  7. [15]

    A guide to checkers families and rules,

    S. Ratrout, “A guide to checkers families and rules,” 2018, unpublished. [Online]. Available: https://www.academia.edu/28503616/A Guide to Checkers Families and Rules

    2018

  8. [16]

    (2025) Rules of draughts (checkers)

    World Checkers/Draughts Federation. (2025) Rules of draughts (checkers). [Online]. Available: https://wcdf.net/rules.htm

    2025

  9. [17]

    Edwards, C

    E. Edwards, C. Suplee, C. Cesare, B. Bedford, J. Donohue, D. Genkina, and M. Shivani. The quantum atlas. [Online]. Available: https://quantumatlas.umd.edu/

  10. [18]

    On the role of entanglement in quantum- computational speed-up,

    R. Jozsa and N. Linden, “On the role of entanglement in quantum- computational speed-up,”Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, vol. 459, no. 2036, pp. 2011–2032, Aug. 2003. [Online]. Available: https://doi.org/10...

    2011

  11. [19]

    M. Raat, L. van den Nouwenland, M. M ¨uller-Brockhausen, M. Preuss, and E. van Nieuwenburg. (2025) Cheqqers source code. [Online]. Available: https://github.com/raatmarien/cheqqers

    2025

  12. [20]

    Bandit based monte-carlo planning,

    L. Kocsis and C. Szepesv ´ari, “Bandit based monte-carlo planning,” in Proc. ECML 2006, J. F ¨urnkranz, T. Scheffer, and M. Spiliopoulou, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006, pp. 282–293. [Online]. Available: https://doi.org/10.1007/11871842 29

    2006 doi

  13. [21]

    Monte carlo tree search: A review of recent modifications and applications,

    M. ´Swiechowski, K. Godlewski, B. Sawicki, and J. Ma ´ndziuk, “Monte carlo tree search: A review of recent modifications and applications,” Artificial Intelligence Review, vol. 56, no. 3, pp. 2497–2562, 2023. [Online]. Available: https://doi.org/10.1007/s10462-022-10228-y

    2023 doi

  14. [22]

    Mastering the game of go with deep neural networks and tree search,

    D. Silver, A. Huang, C. J. Maddison, A. Guez, L. Sifre, G. Van Den Driessche, J. Schrittwieser, I. Antonoglou, V . Panneershelvam, M. Lanctotet al., “Mastering the game of go with deep neural networks and tree search,”Nature, vol. 529, no. 7587, pp. 484–489,

  15. [23]

    Trueskill™: a bayesian skill rating system,

    R. Herbrich, T. Minka, and T. Graepel, “Trueskill™: a bayesian skill rating system,” inProceedings of the 20th International Conference on Neural Information Processing Systems (NIPS’06). Cambridge, MA, USA: MIT Press, 2006, p. 569–576. [Online]. Available: https://dl.acm.org/...

    2006

  16. [2016]

    Available: http://www.nature.com/nature/journal/v529/ n7587/full/nature16961.html

    [Online]. Available: http://www.nature.com/nature/journal/v529/ n7587/full/nature16961.html

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.