Forced Combination (Partition Matching)
The digits of the run are known; match each one to a cell so that every cell is allowed to hold its digit.
placed key digits removed
Why it works
Even when a run has several possible partitions, the crossing runs often leave only one way to assign the digits to the cells. That is a bipartite matching problem, and it can be solved exactly.
The app checks every assignment in polynomial time and reports the digits that every assignment keeps in a cell, and the ones no assignment uses there.
How to spot it
- Find the partitions that fit the remaining sum and the number of empty cells.
- For each partition, try to place its digits into the cells so that every cell accepts its digit.
- A cell that takes the same digit in every successful assignment is solved. A digit that no assignment puts in a cell can be removed there.
Practice it
Open the app, choose a level that uses this technique, and ask the coach for the next step. Every hint links back to this guide.