Transitive avoidance games on boards of odd size (Q2665970)

Summary: Avoidance (or misère) games are a type of positional games. Two players alternately claim points of a set \(N\) (the `board' of the game). The game is determined by a family \(L\) of subsets of \(N\) and the following rule: The first player who claims every point of some set in \(L\) loses the avoidance game. The game is called transitive if the group of all permutations of \(N\) leaving \(L\) invariant acts transitively on \(N\). \textit{J. R. Johnson} et al. [Electron. J. Comb. 24, No. 1, Research Paper P1.61, 23 p. (2017; Zbl 1409.91060)] show that for a board size which is neither a prime number nor a power of two there are transitive avoidance games where the first player can force his win. For primes of size at least \(17\), the corresponding problem remained open. We are going to close this gap and prove that for all primes \(n\) of size at least \(17\) there are also transitive avoidance games with board size \(n\) where the first player can force his win.