Browse · MathNet
Print59th Ukrainian National Mathematical Olympiad
Ukraine counting and probability
Problem
Andrew and Olesya in turn cut some squares or from the rectangle , following the lines in such a way that after every turn the remaining figure stays connected. The one who cannot make a move loses. Who is going to win if both children play the best they can, and Olesya is the first?
(Bogdan Rublyov)

(Bogdan Rublyov)
Solution
We proceed by induction on . One can verify that if the field is Olesya wins (by cutting entire square), and if the field is then Andrew wins (casework). If , then Olesya can cut square from the end of a strip and place herself in the position of a second player for even . Hence, it remains to prove only that second player wins for even .
Prior to and including the first square cut by the first player in the bordering column (i.e. the first or the last column of the “active” (see fig. 36) part of the playing field if we assume that the playing strip is placed horizontally) second player can follow the symmetric strategy. Clearly, he will be able to do so. Also, note that the first square will be cut when active playing field has dimensions , where is even (fig. 37).
After that point, the only thing he has to do is to prevent the cutting of square, because it will mean that the game will end after the even number of moves (because both players can cut only ).
Moreover, it is clear that the only places from which the square can be cut are the ends of the playing strip. It means that the second player does not have much to do at all: he cuts a unit square from one of the bordering (for the active part of the field) squares that has no unit squares already cut out ("free" ends).
Clearly, there is no greater than one free end, because Olesya cannot create two free ends in one move, and we "start" (after the first two bordering squares are cut) with zero free ends.
If, however, there are no free ends, then one of the following holds: 1. bordering column has no squares cut out, then Andrew can simply cut one unit square from it; 2. bordering column has one square cut out, a) and the second to border column has a square cut out, then Andrew can simply cut the second unit square from the bordering column; b) and the second to border column has no squares cut out, i. and the third to border column has no squares cut out, or it has a square cut out in the same row as for the bordering column, then Andrew can cut a unit square from the second to border column in the same row; ii. and the third to border column has a square cut out in the different row from that of the bordering column, then Andrew can cut a unit square from the bordering column, effectively decreasing the "active" playing field, but without creating free ends.
Prior to and including the first square cut by the first player in the bordering column (i.e. the first or the last column of the “active” (see fig. 36) part of the playing field if we assume that the playing strip is placed horizontally) second player can follow the symmetric strategy. Clearly, he will be able to do so. Also, note that the first square will be cut when active playing field has dimensions , where is even (fig. 37).
After that point, the only thing he has to do is to prevent the cutting of square, because it will mean that the game will end after the even number of moves (because both players can cut only ).
Moreover, it is clear that the only places from which the square can be cut are the ends of the playing strip. It means that the second player does not have much to do at all: he cuts a unit square from one of the bordering (for the active part of the field) squares that has no unit squares already cut out ("free" ends).
Clearly, there is no greater than one free end, because Olesya cannot create two free ends in one move, and we "start" (after the first two bordering squares are cut) with zero free ends.
If, however, there are no free ends, then one of the following holds: 1. bordering column has no squares cut out, then Andrew can simply cut one unit square from it; 2. bordering column has one square cut out, a) and the second to border column has a square cut out, then Andrew can simply cut the second unit square from the bordering column; b) and the second to border column has no squares cut out, i. and the third to border column has no squares cut out, or it has a square cut out in the same row as for the bordering column, then Andrew can cut a unit square from the second to border column in the same row; ii. and the third to border column has a square cut out in the different row from that of the bordering column, then Andrew can cut a unit square from the bordering column, effectively decreasing the "active" playing field, but without creating free ends.
Final answer
Olesya wins when n is odd; Andrew wins when n is even.
Techniques
Games / greedy algorithmsInduction / smoothing