Given a graph G = (V,E), two players, Alice and Bob, alternate their turns in choosing uncoloured vertices to be coloured. Whenever an uncoloured vertex is chosen, it is coloured by the least positive integer not used by any of its coloured neighbours. Alice’s goal is to minimize the total number of colours used in the game, and Bob’s goal is to maximize it. The game Grundy number of G is the n...