Setup and opening position
The sixteen grid vertices display deterministic counts derived from a unique completed arrangement, while all nine cells begin without a chosen slash direction.
Slant Puzzle
Choose all nine slash directions so the vertex totals match exactly and the resulting diagonal graph remains acyclic.
Loading game
Stats on this device
Your unfinished game is saved only in this browser.
- Played
- 0
- Wins
- 0
- Win rate
- —
- Fastest win
- —
- Fewest moves
- —
- Best score
- —
- Current streak
- 0 days
- Best streak
- 0 days
How to play
Choose all nine slash directions so the vertex totals match exactly and the resulting diagonal graph remains acyclic.
- The sixteen grid vertices display deterministic counts derived from a unique completed arrangement, while all nine cells begin without a chosen slash direction.
- Set each cell to one of its two diagonals or clear an editable choice. A completion must satisfy every vertex count and must not connect diagonal segments into a cycle.
- Choose all nine slash directions so the vertex totals match exactly and the resulting diagonal graph remains acyclic.
Strategy tips
- Resolve corner and edge counts first because fewer cells touch them, then propagate forced orientations inward while watching whether endpoints would close a loop.
- Meeting every local number is insufficient if the last diagonal joins two vertices already connected by a path, because that creates a forbidden closed circuit.
- For the final undecided cells, compare both vertex deficits and connectivity; use the unique-solution hint only after checking that a tempting slash will not complete a cycle.
Complete guide
Rules, scoring, and strategy
Slant Puzzle is a complete browser implementation with its own versioned rules profile. Place one diagonal in every cell of a three-by-three grid so each vertex meets its numbered line count and the diagonal network contains no closed loop.
Legal moves and game flow
Set each cell to one of its two diagonals or clear an editable choice. A completion must satisfy every vertex count and must not connect diagonal segments into a cycle.
Winning and terminal positions
Choose all nine slash directions so the vertex totals match exactly and the resulting diagonal graph remains acyclic. For the final undecided cells, compare both vertex deficits and connectivity; use the unique-solution hint only after checking that a tempting slash will not complete a cycle.
Practical strategy
Resolve corner and edge counts first because fewer cells touch them, then propagate forced orientations inward while watching whether endpoints would close a loop. Meeting every local number is insufficient if the last diagonal joins two vertices already connected by a path, because that creates a forbidden closed circuit.
Questions players ask
What is the objective in Slant Puzzle?
Choose all nine slash directions so the vertex totals match exactly and the resulting diagonal graph remains acyclic.
Which moves are legal in Slant Puzzle?
Set each cell to one of its two diagonals or clear an editable choice. A completion must satisfy every vertex count and must not connect diagonal segments into a cycle.
What should I plan first in Slant Puzzle?
Resolve corner and edge counts first because fewer cells touch them, then propagate forced orientations inward while watching whether endpoints would close a loop.