A first winning-strategy game

Beginner Mathematics English
Also available: Deutsch
Created by Best · 17.07.2026 at 11:55 UTC

Some games are decided before the final move: with perfect play one side wins from a given start. In a take-away game each player removes a fixed number of tokens (here 1 or 2), and whoever takes the last token wins. Play it enough and you feel that some pile sizes are already lost for whoever must move.

The tool is modular arithmetic. With takes of size 1 or 2, the losing pile sizes are the multiples of $3$: whatever you take, the opponent can answer so that the total removed in the round is $3$, and you are left on the next multiple of $3$. A winning strategy is a rule that always hands the opponent a losing position, without relying on their mistakes.

University approvals: 0
Tasks
Question 1

Play the take-away game: from 10 tokens take 1 or 2 each turn. Take the last token to win. The computer plays perfectly.

Question 2

A position is "losing for the player to move" means:

Question 3

A winning strategy is best described as:

Question 4

It is your move and the pile holds 8 tokens, takes of 1 or 2. What do you play?

Card Info
  • Topic: Mathematics
  • Difficulty: Beginner
  • Completed: 0 users
Creator
Best
Best
BestBuddy