Problem #PRU-30434

Problems Set theory and logic Theory of algotithms Game theory Fun games

Problem

There are three groups of stones: in the first – 10, in the second – 15, in the third – 20. During one turn, you are allowed to split any pile into two smaller ones; the one who cannot make a move loses.