暂无分享,去创建一个
In this paper, we propose a Quantum variation of combinatorial games, generalizing the Quantum Tic-Tac-Toe proposed by Allan Goff [2006]. 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.
[1] Stacey Jeffery,et al. NAND-Trees, Average Choice Complexity, and Effective Resistance , 2015, ArXiv.
[2] Aaron N. Siegel. Combinatorial Game Theory , 2013 .
[3] J. N. Leaw,et al. Strategic insights from playing quantum tic-tac-toe , 2010, ArXiv.
[4] Allan Goff,et al. Quantum tic-tac-toe: A teaching metaphor for superposition in quantum mechanics , 2006 .