Sequence Lock · 3 MIN READ
Sequence Lock: count repeated digits only as often as they occur
A three-position example separates exact matches from misplaced copies, then shows how to compare candidate secrets against the complete feedback history.
A better move starts
with a useful idea.
Concrete explanations for the puzzles you can play here. Read a little, try the idea, and notice what changes.
Target Forge · 3 MIN READ
Target Forge: preserve the resources inside every intermediate value
Make 24 from four number tokens without leaving two behind, and distinguish a reusable result from an original number that has already been consumed.
Inequality Grid · 3 MIN READ
Inequality Grid: use a comparison chain before choosing exact values
A strict chain can place bounds on its cells even when it does not solve them. Combine those bounds with Latin-row exclusions instead of treating the signs as decoration.
Loop Links · 3 MIN READ
Loop Links: settle the boundaries before closing a small circuit
Use a corner’s forced directions, check reciprocal pipe ends and avoid mistaking several neat little loops for the one route that must visit the whole board.
Queen Grid · 3 MIN READ
Queen Grid: check the lines before counting the queens
A six-row teaching position explains diagonal conflicts, useful row boundaries and why an apparently safe placement may still need to be undone.
Knight Trail · 3 MIN READ
Knight Trail: protect the next exit, not just the next square
Compare legal moves by the unvisited exits they preserve, and use a short teaching trail to understand when backtracking is more useful than starting over.