#260 - Stone Game
A game is played with three piles of stones and two players.
On each player's turn, the player may remove one or more stones from the piles. However, if the player takes stones from more than one pile, then the same number of stones must be removed from each of the selected piles.
In other words, the player chooses some \(N \gt 0\) and removes:
- \(N\) stones from any single pile; or
- \(N\) stones from each of any two piles (\(2N\) total); or
- \(N\) stones from each of the three piles (\(3N\) total).
The player taking the last stone(s) wins the game.
A winning configuration is one where the first player can force a win.
For example, \((0,0,13)\), \((0,11,11)\), and \((5,5,5)\) are winning configurations because the first player can immediately remove all stones.
A losing configuration is one where the second player can force a win, no matter what the first player does.
For example, \((0,1,2)\) and \((1,3,3)\) are losing configurations: any legal move leaves a winning configuration for the second player.
Consider all losing configurations \((x_i, y_i, z_i)\) where \(x_i \le y_i \le z_i \le 100\).
We can verify that \(\sum (x_i + y_i + z_i) = 173895\) for these.
Find \(\sum (x_i + y_i + z_i)\) where \((x_i, y_i, z_i)\) ranges over the losing configurations with \(x_i \le y_i \le z_i \le 1000\).
Problem text © Project Euler, licensed under CC BY-NC-SA 4.0. Original: projecteuler.net/problem=260. Published Friday, 16th October 2009, 01:00 pm. Solved by 1,547 members at time of mirroring.
Why this is useful
Algorithmic Development. Optimal substructure and state-space reasoning are exactly how American-option pricing and optimal execution are solved (Phases 13, 16).
We classify relevance honestly - not every Euler problem is a trading application.
Prerequisites
Lessons that prepare you:
17.1 Python for Quants: NumPy, pandas, and Vectorization · 19.8 Bit Manipulation and State Compression · 19.14 Computational Complexity, Feasibility Estimation, and Proving Algorithms Correct · 19.7 Dynamic Programming: Memoization and Tabulation
Recommended stepping-stone problems: #899 · #605 · #770
Concepts: game-theory string-processing brute-force-reduction
Likely techniques: bitmask-dp
Learning mode
Pick how much scaffolding you want. Your choice is remembered per problem.
Understand the problem
- What exactly is the input to problem 260? Is it a bound (1000), a supplied dataset, or a definition you must generate from?
- What is the required output - restate it precisely: a single sum.
- Which objects exactly are in scope, and which are excluded by the wording (strict vs non-strict inequality, 'distinct', 'proper', 'below' vs 'up to')?
- What constraint does the bound 1000 impose, and is it inclusive or exclusive?
- What are the edge cases: the smallest legal object, zero/one, ties, and the boundary at exactly 1000?
- Why is brute force hard HERE specifically? Estimate the number of candidates implied by 1000 and the cost of testing one.
- Which game-theory fact would, if true, collapse the search - and can you state it as a testable claim before you look for a proof?
Predict & plan (before you code)
- Predict the strategy: in one sentence, what will your solution do? (The classification says game-theory / bitmask-dp - do you agree, and why?)
- Predict the complexity of your intended method in terms of N = 1000, and the wall-clock time you expect. Write both down now.
- Predict the key data structure: what is stored, keyed by what, and how large will it get at full scale?
- Predict the failure mode: what is most likely to break - an off-by-one on the bound, a definition misread, precision, or memory?
- Predict the output of the small case from rung 3 BEFORE running it (the statement says: "For example, (0,0,13), (0,11,11), and (5,5,5) are winning configurations because the first player can immediately remove all stones.") - then run it. A surprise here is worth more than an hour of debugging later.
Scratchpad
Mathematical notes, formulas, pseudocode, hypotheses, complexity notes. Saved automatically with your progress.
Python workbench
Real Python (Pyodide) in a sandboxed Web Worker - no network, no filesystem, no DOM access. Ctrl/Cmd+Enter runs. Escape leaves the editor. Stop terminates the worker.
Check your answer
Answers are checked against a salted hash held in a separate file - not printed in this page. This prevents accidental spoilers; it is not cryptographic protection (see the build notes).
Progressive hints
Optimization
You have a correct answer. That is the start of the learning, not the end.
- Reduce the time complexity. What is the bottleneck, and what mathematical fact removes it?
- Reduce memory. Can you stream, or keep only the last k states?
- Replace brute force with a closed form, a sieve, a recurrence, or a symmetry argument.
- Prove the optimized version computes the same thing.
- Compare two implementations and time them.
Explain it
Which step of your solution were you least confident about, and what evidence would settle it?
What did you try first, and what specifically made you abandon it - a proof, a timing, or a wrong small-case answer?
Where did the game-theory structure do the real work? Name the single observation that collapsed the search space.
Could you have reached the bitmask-dp idea faster? Which words in the statement were pointing at it, and did you notice them?
What was the bug that cost you the most time, and what CLASS of bug was it (off-by-one, definition misread, precision, state under-specified)?
How would your solution change if the bound 1000 were multiplied by 1000? Does it survive, or does it need a different idea?
What is the honest complexity of what you wrote (not what you intended), and where is the remaining slack?
Which problem you have already solved is this most similar to, and what is the shared skeleton - is it really 'bitmask-dp' underneath?
State the transferable technique in one sentence, without mentioning this problem's story at all.
Self-assess (mastery is not a correct number)
You reach Mastered only when you have solved it, rated yourself at least Solid across the dimensions, and written a real explanation.
Confidence
Low confidence schedules this problem for spaced review, even if you solved it.
Mastery check
- Variation: change the bound (or a rule) in the statement. Does your method still work? What breaks first?
- Constraints: if the limit were 10× larger, which step fails, and what would you replace it with?
- Related problem: #899 · #605 · #770
- Transfer: where else does this technique appear? Name a lesson and a real computational setting.
- Spaced re-attempt: come back after the review interval and re-solve it with no hints.