Abstract
This paper is inspired by the PQ penny flip game. It employs group-theoretic concepts to study the original game and its possible extensions. In this paper, it is shown that the PQ penny flip game can be associated, in a precise way, with the dihedral group D8 and that within D8 there exist precisely two classes of equivalent winning strategies for Q. This is achieved by proving that there are exactly two different sequences of states that can guarantee Q’s win with probability 1.0. It is demonstrated that the game can be played in every dihedral group D8n, where n≥1, without any significant change. A formal examination of what happens when Q can draw their moves from the entire U(2), leads to the conclusion that, again, there are exactly two classes of winning strategies for Q, each class containing an infinite number of equivalent strategies, but all of them sending the coin through the same sequence of states as before. Finally, when general extensions of the game, with the quantum player having U(2) at their disposal, are considered, a necessary and sufficient condition for Q to surely win against Picard is established: Q must make both the first and the last move in the game.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference31 articles.
1. Game Theory;Maschler,2020
2. Games of Strategy;Dixit,2015
3. Game Theory;Myerson,1997
4. Quantum Strategies
5. Quantum Games and Quantum Strategies
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献