Platon Sudoku · Sudoku Study
Exhaustive branches · Core Concepts
Every possible starting value needs a branch. Cells with two, three or four candidates need two, three or four branches.
This course is adapted from Platon Sudoku App. Read the complete example here, then continue learning and practising in the app.
View on Google Play ↗Definition
Every possible starting value needs a branch. Cells with two, three or four candidates need two, three or four branches.
How to find it
Count all starting candidates and make one exclusive branch for each possible value.
Common mistake
Omitting a third value leaves a gap, even if the first two branches agree.
2 branches
Teaching board · local candidate diagram
Observe candidates
Every possible starting value needs a branch. Cells with two, three or four candidates need two, three or four branches.
r2c2 has 2 candidates 2, 3; the diagram checks 2 corresponding branches.Verify the condition
Count all starting candidates and make one exclusive branch for each possible value.
r2c2 has 2 candidates 2, 3; the diagram checks 2 corresponding branches.Draw the conclusion
Every candidate in the starting cell has its own checked branch, covering all possible values.
r2c2 has 2 candidates 2, 3; the diagram checks 2 corresponding branches.Branch A: checked · Branch B: checked
3 branches
Teaching board · local candidate diagram
Observe candidates
Every possible starting value needs a branch. Cells with two, three or four candidates need two, three or four branches.
r2c2 has 3 candidates 2, 3, 4; the diagram checks 3 corresponding branches.Verify the condition
Count all starting candidates and make one exclusive branch for each possible value.
r2c2 has 3 candidates 2, 3, 4; the diagram checks 3 corresponding branches.Draw the conclusion
Every candidate in the starting cell has its own checked branch, covering all possible values.
r2c2 has 3 candidates 2, 3, 4; the diagram checks 3 corresponding branches.Branch A: checked · Branch B: checked · Branch C: checked
4 branches
Teaching board · local candidate diagram
Observe candidates
Every possible starting value needs a branch. Cells with two, three or four candidates need two, three or four branches.
r2c2 has 4 candidates 2, 3, 4, 5; the diagram checks 4 corresponding branches.Verify the condition
Count all starting candidates and make one exclusive branch for each possible value.
r2c2 has 4 candidates 2, 3, 4, 5; the diagram checks 4 corresponding branches.Draw the conclusion
Every candidate in the starting cell has its own checked branch, covering all possible values.
r2c2 has 4 candidates 2, 3, 4, 5; the diagram checks 4 corresponding branches.Branch A: checked · Branch B: checked · Branch C: checked · Branch D: checked
Recognition practice
Teaching board · local candidate diagram
Recognition practice 1
Do the checked branches cover every candidate in the start cell?
Teaching board · local candidate diagramBranch A: checked · Branch B: checked
Draw the conclusion
Yes
Recognition practice 2
Do the checked branches cover every candidate in the start cell?
Teaching board · local candidate diagramBranch A: checked · Branch B: missing
Draw the conclusion
No
Recognition practice 3
Do the checked branches cover every candidate in the start cell?
Teaching board · local candidate diagramBranch A: checked · Branch B: checked · Branch C: checked
Draw the conclusion
Yes
Recognition practice 4
Do the checked branches cover every candidate in the start cell?
Teaching board · local candidate diagramBranch A: checked · Branch B: checked · Branch C: missing
Draw the conclusion
No
Recognition practice 5
Do the checked branches cover every candidate in the start cell?
Teaching board · local candidate diagramBranch A: checked · Branch B: checked · Branch C: checked · Branch D: checked
Draw the conclusion
Yes
Recognition practice 6
Do the checked branches cover every candidate in the start cell?
Teaching board · local candidate diagramBranch A: checked · Branch B: checked · Branch C: checked · Branch D: missing
Draw the conclusion
No
Recognition practice 7
Do the checked branches cover every candidate in the start cell?
Teaching board · local candidate diagramBranch A: checked · Branch B: checked
Draw the conclusion
Yes
Recognition practice 8
Do the checked branches cover every candidate in the start cell?
Teaching board · local candidate diagramBranch A: checked · Branch B: missing
Draw the conclusion
No
Recognition practice 9
Do the checked branches cover every candidate in the start cell?
Teaching board · local candidate diagramBranch A: checked · Branch B: checked · Branch C: checked
Draw the conclusion
Yes
Recognition practice 10
Do the checked branches cover every candidate in the start cell?
Teaching board · local candidate diagramBranch A: checked · Branch B: checked · Branch C: missing
Draw the conclusion
No
Recognition practice 11
Do the checked branches cover every candidate in the start cell?
Teaching board · local candidate diagramBranch A: checked · Branch B: checked · Branch C: checked · Branch D: checked
Draw the conclusion
Yes
Recognition practice 12
Do the checked branches cover every candidate in the start cell?
Teaching board · local candidate diagramBranch A: checked · Branch B: checked · Branch C: checked · Branch D: missing
Draw the conclusion
No
Practice
This course is adapted from Platon Sudoku App. Read the complete example here, then continue learning and practising in the app.
View on Google Play ↗