Setup and opening position
Five labeled vertices occupy distinct points on a three-by-three anchor grid, while five immutable graph edges begin visibly crossed in a deterministic arrangement.
Untangle
Place every labeled vertex on its solver-verified target anchor so the fixed graph is presented in its prescribed untangled layout.
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
Place every labeled vertex on its solver-verified target anchor so the fixed graph is presented in its prescribed untangled layout.
- Five labeled vertices occupy distinct points on a three-by-three anchor grid, while five immutable graph edges begin visibly crossed in a deterministic arrangement.
- Move one vertex at a time to any unoccupied anchor. Vertices remain labeled, edges stay attached to their original endpoints, and occupied or outside positions are illegal.
- Place every labeled vertex on its solver-verified target anchor so the fixed graph is presented in its prescribed untangled layout.
Strategy tips
- Identify the vertex involved in several crossings and move it into open space first, using spare anchors to avoid trapping a different vertex on its destination.
- Swapping labels mentally does not change the graph: each vertex keeps its incident edges, and placing the wrong label on a clear-looking anchor cannot complete the target.
- Use the remaining empty anchors as a buffer when two displaced labels block each other's targets, then place the highest-degree vertex before the final leaf vertex.
Complete guide
Rules, scoring, and strategy
Untangle is a complete browser implementation with its own versioned rules profile. Move five labeled graph vertices among nine anchor positions until every vertex reaches the canonical crossing-free layout for the fixed set of connecting edges.
Legal moves and game flow
Move one vertex at a time to any unoccupied anchor. Vertices remain labeled, edges stay attached to their original endpoints, and occupied or outside positions are illegal.
Winning and terminal positions
Place every labeled vertex on its solver-verified target anchor so the fixed graph is presented in its prescribed untangled layout. Use the remaining empty anchors as a buffer when two displaced labels block each other's targets, then place the highest-degree vertex before the final leaf vertex.
Practical strategy
Identify the vertex involved in several crossings and move it into open space first, using spare anchors to avoid trapping a different vertex on its destination. Swapping labels mentally does not change the graph: each vertex keeps its incident edges, and placing the wrong label on a clear-looking anchor cannot complete the target.
Questions players ask
What is the objective in Untangle?
Place every labeled vertex on its solver-verified target anchor so the fixed graph is presented in its prescribed untangled layout.
Which moves are legal in Untangle?
Move one vertex at a time to any unoccupied anchor. Vertices remain labeled, edges stay attached to their original endpoints, and occupied or outside positions are illegal.
What should I plan first in Untangle?
Identify the vertex involved in several crossings and move it into open space first, using spare anchors to avoid trapping a different vertex on its destination.