Skip to main content

Original ideas for clearer play

Orbace Journal

A record of how Sudoku is solved, taught, and shaped. The Journal turns interesting games into substantial original lessons — giving players something useful to read before the next puzzle.

Su-Pu Studies

The studies, in order.

When the Branch Holds: Finishing Without Contradiction
Lesson 07 · August 22, 2026 · 8 min

When the Branch Holds: Finishing Without Contradiction

What happens when your chosen candidate turns out to be correct? A look at the ibtree method's success path—and a practical verification technique for any completed grid.

ExtremeIbtreeConfined GroupSolution Verification
Three-Way Fork in Box 9: A Double Contradiction
Lesson 06 · August 2, 2026 · 8 min

Three-Way Fork in Box 9: A Double Contradiction

When three candidates compete for the same digit, a two-layer ibtree resolves the uncertainty—eliminating two false paths to prove the third.

ExtremeHell-tierIbtreeProof by ContradictionThree-Way Fork
A Puzzle Worth Remembering: Beauty Meets Ibtree
Lesson 05 · July 30, 2026 · 9 min

A Puzzle Worth Remembering: Beauty Meets Ibtree

When a Hell-tier puzzle’s elegant initial state meets the ibtree method’s sharp forks, even a Hodoku 7820 becomes a study in creative leverage.

Hell-tierIbtreeProof by ContradictionExtreme
The starting grid: puzzle D42126, rated Hell level 9
Lesson 04 · July 28, 2026 · 8 min

Taming the 'Hell' Puzzle: One Fork, Seven Minutes

When candidate reduction demands a dozen advanced techniques, ibtree finds an elegant path through a single well-chosen assumption.

Hell-tierIbtreeProof by Contradiction
The Three-Way Fork: Restructuring Multiple Branches
Lesson 03 · July 30, 2026 · 8 min

The Three-Way Fork: Restructuring Multiple Branches

When three candidates vie for one position, treat it as two binary decisions—and watch a Hell-tier puzzle collapse.

Hell-tierIbtreeProof by ContradictionBinary Tree
The Knight's Move: A Second Proof by Contradiction
Lesson 02 · July 31, 2026 · 8 min

The Knight's Move: A Second Proof by Contradiction

When two candidates in a box form a knight's-move pattern, one often acts as a chain trigger—tracing it forward quickly reveals which assumption leads to contradiction.

ExtremeIbtreeProof by ContradictionBinary Tree
Two Homes for a Nine
Lesson 01 · July 31, 2026 · 8 min

Two Homes for a Nine

When basic methods stall, look for a binary fork—two candidates in one box—and trace one forward to find your proof by contradiction.

ExtremeIbtreeProof by ContradictionBinary Tree

Puzzle Challenge

Found a puzzle that beat you? Send it in.

Submit a Sudoku you couldn't crack — your own or one you found elsewhere. If it checks out, we'll solve it, reconstruct the study, and publish it here with your credit (or anonymously, your call).

Submit a puzzle →

Explore the journal

Beginner

Learn without guessing

Rules, scanning, candidates, and a dependable first solving method.

Strategies

Understand why it works

Formal patterns explained through real positions and useful eliminations.

Puzzle Craft

What makes a grid satisfying?

Logical flow, validation, turning points, and thoughtful difficulty.

Advertisement
Loading…
数 Orbace Sudoku Free daily Sudoku with replays — no account, offline. App Store Google Play

How the Journal is made

From a real solve to a useful lesson.

Select

Choose and verify a noteworthy solve.

Reconstruct

Rebuild the Su-Pu and draft the lesson.

Review

Check the logic against the playable position.

Publish

Release, link practice, and correct openly.