Leyline

Untangle the lines so none of them cross. Same knot for everyone, fastest time wins.

Today · Sun 27 Sep Sudoku — Wordle — Boggle — Cascade — Leyline —

Game Settings

Mode

Daily is the same tangle for everyone at 6 lines, once a day. Free play deals a new one whenever you want, at whichever size you like.

Tab steps between nodes, the arrow keys move the one you are on, and Shift + an arrow moves it five times as far.

The Tangle

0:00

Time

—

Crossings

Moves

Dealing a tangle…

Office leaderboard

Daily

Period

Loading the board…

Fastest time first. Today's daily posts once — replay it as often as you like, but only the first run goes on the board. Times are worked out and posted by the browser, so treat the board as a bit of fun.

Every node is joined to its neighbours by straight lines, and the lines start crossing each other. Move the nodes until none of them do. There is always a way — the tangle is built by scattering straight lines across the board and taking their crossings as nodes, so a flat layout is known to exist before you ever see it.

Drag a node with the mouse or a finger. The count updates as you move, so you can see a crossing go.
Crossing lines are marked — drawn thicker as well as in the alert colour, so the state never rests on colour alone.
Keyboard works too. Tab steps between nodes, the arrow keys move the one you are on, and Shift + an arrow moves it further. The node you are on carries a ring.
Daily is 6 lines for everyone, ranked by the fastest time. Free play lets you pick 5, 6 or 7 lines and deals as many as you like.
Moves are counted but not ranked. Nudging one node five times is five moves, so it is a bragging number rather than a measure of anything.

What the board is telling you

A line with nothing in its way.
A line crossing another one. Both ends of every crossing pair are marked, so you can see what to pull apart.
A node. Drag it, or focus it and use the arrow keys.

The three sizes
Lines	Nodes	Links
5	10	15
6 — the daily	15	24
7	21	35

N lines give N×(N−1)÷2 nodes and N×(N−2) links: each line meets the other N−1, which is N−1 points along it and therefore N−2 segments.