MathDB
game rectangle with 60 rows and 40 columns

Source: Germany 2001 p3

February 23, 2020
gamegame strategycombinatorial geometrycombinatorics

Problem Statement

Wiebke and Stefan play the following game on a rectangular sheet of paper. They start with a rectangle with 6060 rows and 4040 columns and cut it in turns into smaller rectangles. The cuttings must be made along the gridlines, and a player in turn may cut only one smaller rectangle. By that, Stefan makes only vertical cuts, while Wiebke makes only horizontal cuts. A player who cannot make a regular move loses the game. (a) Who has a winning strategy if Stefan makes the first move? (b) Who has a winning strategy if Wiebke makes the first move?