Conina

Start from finished, then swap.

Rows is the piece on the table. Two of us, one puzzle, no client list beside it. Each row wants a single colour: ink, clay, sand, moss. Four tiles each.

A random fill of those tiles is usually solvable and sometimes isn't, and telling those apart is a worse puzzle than the one we meant. So a new deal begins on a solved board and applies a fixed run of swaps. Every swap can be swapped back. If a run lands on solved anyway, it shuffles again.

The page remembers the deal, the tiles, and the swap count. A new deal moves the number on by one. The best count is the fewest swaps that reached four even rows in this browser.

Back to the tiles.