A Quantum Adaptation for the Morra Game and Some of Its Variants

Abstract

The Morra game is quite old. Back in time, traces of it can be found in ancient Egypt, ancient Rome, and even China. It involves two players who, for a limited number of turns, must try to suppose the sum of the number personally chosen with the number chosen by the opponent. The rules are simple, but it is rather difficult to play at a high level as there are multiple cognitive, motor, and perceptual processes involved. <p xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">The goal of this paper is to illustrate the process of implementing a quantum random player for the Morra game and some of its variants. This can be done by using a quantum number generator circuit to generate two numbers and a quantum adder to obtain the supposed sum. The advantage of this proposal is that, unlike the implementations of the Morra game on classical computers, which only allow the generation of pseudo-random numbers, true randomness can be obtained through quantum computing. <p xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">In addition to the description of the entire algorithms, the source code of the implementations is provided to give everyone the freedom to easily test both the quantum implementation of the Morra game and the variants discussed in the paper.