# Toward Quantum Combinatorial Games

**Authors:** Paul Dorbec (LaBRI), Mehdi Mhalla (LIG)

arXiv: 1701.02193 · 2018-03-06

## TL;DR

This paper introduces quantum variations of combinatorial games, exploring superpositions of moves and their effects on game outcomes, with specific focus on Nim and different rulesets.

## Contribution

It generalizes classical combinatorial games to include quantum superpositions, analyzing how different rulesets influence game outcomes and introducing quantum Nim variants.

## Key findings

- Different rulesets lead to varied game outcomes
- Quantum Nim variants exhibit unique strategic properties
- Superpositions affect the outcome probabilities

## Abstract

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.

## Full text

_Full body text omitted from this summary view._ Fetch the complete paper as Markdown: https://tomesphere.com/paper/1701.02193/full.md

## Figures

3 figures with captions in the complete paper: https://tomesphere.com/paper/1701.02193/full.md

## References

10 references — full list in the complete paper: https://tomesphere.com/paper/1701.02193/full.md

---
Source: https://tomesphere.com/paper/1701.02193