Naoki and Richard in turn put chips in free squares
Source: Tuymaada 2009, Junior League, First Day, Problem 1
July 19, 2009
geometrygeometric transformationcombinatorics unsolvedcombinatorics
Problem Statement
All squares of a 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