Analyzing -player Maundy Cake

The game of n -player Maundy Cake is the n -player version of Maundy Cake, a classic combinatorial game. Even though determining the solution of Maundy Cake is trivial, solving the n -player variant is challenging because of the identification of queer games, i.e., games where no player has a winning strategy. A first analysis of the instances of n -player Maundy Cake is presented. Moreover, some sufficient conditions to guarantee a winning strategy in some special cases are also presented.