olymmath

DE-MO 2001 Problem 3

    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?

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator de-mo/2001/p3 · Tag 7T6ZKCNTJG · Edit this page on GitHub · Keys: j next, k previous