olymmath

BALTIC-WAY 2010 Problem 9

  • Answer

There is a pile of 1000 matches. Two players each take turns and can take 1 to 5 matches. It is also allowed at most 10 times during the whole game to take 6 matches, for example 7 exceptional moves can be done by the first player and 3 moves by the second and then no more exceptional moves are allowed. Whoever takes the last match wins. Determine which player has a winning strategy.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

The\ second\ player\ wins.

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

Locator baltic-way/2010/p9 · Tag 62NVNM8EEK · Edit this page on GitHub · Keys: j next, k previous