Analyzing on My Turf Game Over Some Finite Non-Abelian Groups
The aim of this paper is to solve the “ON MY TURF" game over some finite nonabelian groups. Also, it presents the following results: 1-) If G has odd order, and the set F contains the identity element, then the first player A has a winning strategy. If F does not contain the identity, then B has a winning strategy. 2-) If G has an even order with only one element of order two, there is a winning strategy related to set F. 3-) If G has an even order with only three elements of order two which generate a subgroup isomorphic to Z2 × Z2, there is a winning strategy related to the set F.
Volume & Issue
Vol. Volume 1 / Iss. Issue 1