Credited with solving this puzzle:
32 pebbles are placed on the six edges of a tetrahedron, as shown in the following figure.
Two players are playing a game. Each player, on her turn, can take as many pebbles as she chooses, but a minimum of one pebble must be taken each turn, and all the pebbles taken must be on the same face. If you cannot play (i.e., if all the pebbles are taken) – you lose.
What are the winning moves, for the first player, in this situation?
For example, if the first player plays 0,0,3,0,8,13 i.e., taking the whole northeast face, leaving the tetrahedron as 1,2,0,5,0,0; then the second player can win by playing 0,1,0,4,0,0 on the bottom face which leaves 1,1,0,1,0,0; and for every possible move of the first player, the second player can immediately win.
Please supply your answer as a list of lines, each line is a possible move.
