A q-player impartial avoidance game for generating finite groups
- 213 Downloads
We study a q-player variation of the impartial avoidance game introduced by Anderson and Harary, where q is a prime. The game is played by the q players taking turns selecting previously-unselected elements of a finite group. The losing player is the one who selects an element that causes the set of jointly-selected elements to be a generating set for the group, with the previous player winning. We introduce a ranking system for the other players to prevent coalitions. We describe the winning strategy for these games on cyclic, nilpotent, dihedral, and dicyclic groups.
KeywordsGroup theory Game theory Impartial game Maximal subgroup
Mathematics Subject Classification91A46 20D30
- Barnes FW (1988) Some games of F. Harary, based on finite groups. Ars Comb 25(A):21–30 (Eleventh British Combinatorial Conference (London, 1987)) Google Scholar
- Benesh BJ, Ernst DC, Sieben N (2016) Impartial avoidance games for generating finite groups. North-West Eur J Math 2:83–102Google Scholar
- Isaacs IM (2009) Algebra: a graduate course, vol 100. American Mathematical Society, Providence (Reprint of the 1994 original) Google Scholar