Problem #PRU-100355

Problems Discrete Mathematics Algorithm Theory Game theory Game theory (other) Winning and loosing positions

Problem

Tweedledum and Tweedledee play a game. They have written numbers 1, 2, 3, 4 in a circle. Tweedledum, who makes the first move, can add 1 to any two adjacent numbers; while Tweedledee is allowed to exchange any two adjacent numbers. Tweedledum wins if all the numbers become equal. Can Twedleedee prevent Tweedledum from winning if both must make a move every turn?