olymmath

TUYMAADA 2009 J1

  • Junior

All squares of a 20×2020\times 20 table are empty. Misha* and Sasha** in turn put chips in free squares (Misha* begins). The player after whose move there are four chips on the intersection of two rows and two columns wins. Which of the players has a winning strategy?

Proposed by A. Golovanov

US Name Conversions:

Misha: Naoki Sasha**: Richard*

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 tuymaada/2009/j1 · Tag Q5J80RE043 · Edit this page on GitHub · Keys: j next, k previous