Toward Quantum Combinatorial Games

Paul Dorbec
(Univ. Bordeaux, LaBRI, UMR 5800, F-33400 Talence, France)
Mehdi Mhalla
(Univ. Grenoble Alpes, CNRS, Grenoble INP, LIG, F-38000 Grenoble France)

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.

In Bob Coecke and Aleks Kissinger: Proceedings 14th International Conference on Quantum Physics and Logic (QPL 2017), Nijmegen, The Netherlands, 3-7 July 2017, Electronic Proceedings in Theoretical Computer Science 266, pp. 237–248.
Published: 27th February 2018.

ArXived at: http://dx.doi.org/10.4204/EPTCS.266.16 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org