The Subset Sum Puzzle: Who Has a Winning Strategy?

Choose ten integers from 1 to 100, then look for two different subsets with the same sum.

チャンネル
3Blue1Brown
公開日
2026年3月25日
動画
0:48
読了時間
1 分
原文
英語
YouTube で開く
スクロールすると動画は右下に小さくなって再生を続けます。字幕は閲覧言語に合わせて切り替わります。
閲覧言語2 言語で読めます
この記事はまだ日本語に翻訳されていないため、英語の原文を表示しています。
要約

30 秒でわかる

3Blue1Brown and MoMath pose a game about equal subset sums and ask which player can guarantee a win.

  1. 1The player’s taskFind two different subsets with the same sum.
  2. 2The chooser’s taskFind ten numbers with no equal-sum pair of distinct subsets.
  3. 3An open challengeThe short video leaves the solution for a later installment.

ポイント

  1. Ten distinct integers are chosen from 1 through 100.
  2. One player seeks two distinct subsets with equal sums; the other seeks a selection that makes that impossible.
  3. The short video poses the puzzle without presenting the solution.
全文

チャプターごとに整えた全文を読む

文字起こしのみ
01

The rules

Choose ten numbers and compare sums of subsets.

Imagine a game played with the integers from 1 through 100. I choose ten distinct numbers and show them to you.

Your task is to find two distinct subsets of those ten numbers whose sums are equal. For example, two different pairs might both add up to 102. If you find such a pair of subsets, you win.

02

Who can force a win?

Decide whether the chooser can prevent an equal-sum pair.

I win if I can choose ten numbers for which no two different subsets have the same sum. The puzzle is to determine which player has a winning strategy.

This is a monthly puzzler made with MoMath. The short video poses the question and leaves the solution for a later installment.

同じチャンネルの記事

スライド 20 枚40:44EN
3Blue1Brown· 2026年10月16日Grant Sanderson: There's never been a better time to go into mathGrant Sanderson, Constantin Kogler · 3Blue1BrownStudents fear AI has solved mathematics. Grant Sanderson argues the opposite: even if machines prove theorems better than we do, the institution of math stays valuable—and this is a rare moment when newcomers can reshape it.MathematicsAI for scienceHuman-AI Collaboration+2
スライド 29 枚51:55EN
3Blue1Brown· 2026年9月18日The last IMO problem AI could not solveGrant Sanderson · 3Blue1BrownGrant Sanderson walks through IMO 2025 Problem 6 — a tiling puzzle that frontier models missed — and the visual patience it takes to prove a construction is optimal.MathematicsAI researchReasoning & test-time compute+2
0:55EN
3Blue1Brown· 2026年7月24日The 64 Sugar Cubes Puzzle: Six Equal DistancesA 4×4×4 block has three colors; prove that six same-colored pairs share a distance.MathematicsEducation
スライド2:25EN
3Blue1Brown· 2026年6月12日How Shannon Measured the Entropy of EnglishA guessing game helped Claude Shannon estimate how much information English text contains, and why prediction is central to compression.MathematicsAI History
スライド1:02EN
3Blue1Brown· 2026年6月10日A Robot Walk and the Puzzle of Optimal Binary EncodingHow few bits does it take to send directions that occur with unequal frequencies?MathematicsScience Communication
スライド 4 枚32:19EN
3Blue1Brown· 2026年6月7日Reinventing Entropy: Why Prediction Helps Compress LanguageA robot’s movement code leads from prefix-free encoding to Shannon information and the entropy of language.MathematicsScience Communication