A       B
+-----+
|        |
|        |
+-----+
D       C

Precisely one stone is situated initially at each of the four vertices of the square ABCD. It is permissible to change the number of stones according to the following rule:

Any move consists of taking n stones away from any vertex and adding 2n stones to either adjacent vertex.

Prove that it is not possible to get 1989, 1988, 1990 and 1989 stones respectively at the vertices A, B, C and D after a finite number of moves.

3x4 Knight Swap |
Posted on 2010-02-13 by K Sengupta (No Solution Yet, 6 Comments)

The Red Stack | Rating: 3.50
Posted on 2009-12-04 by Brian Smith (No Solution Yet, 2 Comments)

3x3 Nim | Rating: 4.00
Posted on 2009-06-25 by Jer (Solution Posted, 25 Comments)

Knights' Tours - Long & Short | Rating: 4.00
Posted on 2009-05-05 by brianjn (Solution Posted, 7 Comments)

Two players, two pots | Rating: 2.00
Posted on 2009-02-21 by pcbouhid (Solution Posted, 2 Comments)

Shuffle | Rating: 5.00
Posted on 2009-01-09 by brianjn (Solution Posted, 4 Comments)

The missing piece (chess) | Rating: 4.00
Posted on 2008-06-12 by pcbouhid (Solution Posted, 15 Comments)