Water Sort Patterns

The Solving Mindset

Think in stacks, not in moves

Water Sort looks like a game of pouring, but it is really a game of stacks. Every tube is a stack with a strict rule: you can only access the top layer, and you can only pour onto a matching top layer or onto an empty tube. That single constraint turns each level into a sequencing problem — and sequencing problems have patterns. The players who struggle are the ones pouring reactively, hoping the next move will reveal itself. The players who fly through levels are the ones reading the stacks and predicting the solved state backwards.

Before you make your first pour, do two things. First, count the distinct colors on the board and confirm there are exactly enough tubes for each color to end up alone in its own tube (plus at least one spare empty tube, which you will need as a buffer). Second, pick the color that is closest to solved — the one whose pieces are already gathered near the tops of one or two tubes — and make completing that color your first objective. Solving one color frees up an entire tube, which becomes the buffer that unlocks the rest of the board.

The four habits of strong solvers

• Reason backwards: Picture the solved state and ask "what was the last move that produced this?" Work backwards to find the move before that. Chains of backwards reasoning reveal forced sequences.
• Hoard your empty tubes: An empty tube is your only buffer. Never fill the last empty tube unless doing so immediately completes a color and re-opens a new empty tube in its place.
• Solve the bottleneck color first: The color whose pieces are most scattered is the one that will block you. Tackle it early, while you still have buffers to spare.
• Match the bottom, not the top: When building a clean tube, you care about what sits at the bottom — the foundation color. Everything above it is temporary scaffolding that must be moved out of the way first.

One mental model that changes everything: treat each tube as two layers — a foundation (the bottom color, which is locked once it has matching colors above it) and overflow (everything on top that does not match the foundation). Your job is to drain the overflow into buffers, expose the foundation, then stack matching colors onto it. Once a foundation is exposed and matching colors are poured onto it, that tube is solved and becomes off-limits. This two-layer view turns chaos into a checklist.

Pattern 1 — Isolation

The foundation move of every level

Isolation is the most common pattern in Water Sort and the one you will use on virtually every level. The idea is simple: pick one color and deliberately gather all of its pieces into a single tube, building it from the bottom up. Every other move you make exists to support this goal — either by draining overflow off the target tube, or by ferrying matching pieces onto its foundation.

The procedure is mechanical. Identify the tube that will become your "clean" tube — usually the one that already has the most pieces of a single color at its bottom. Pour off the overflow (the non-matching colors sitting on top of the foundation) into buffers, one layer at a time, until the foundation is exposed at the top. Then locate every other piece of that color across the board and pour each one onto the foundation. When the tube is full of a single color, it is solved, and the tube that previously held the last matching piece becomes your next buffer.

The isolation procedure, step by step

• Choose the target color: Pick the color whose pieces are most concentrated in one tube's lower layers — this minimizes the buffer moves you will need.
• Drain the overflow: Pour each non-matching layer off the top of the target tube into empty buffers, top layer first. Never pour a matching piece off — leave it as part of the foundation.
• Expose the foundation: Once all overflow is removed, the foundation color sits at the top of the target tube, ready to receive more.
• Ferry matches in: Pour every other piece of the target color onto the foundation, from whichever tubes hold them. The target tube fills top-down with one color.
• Lock the solved tube: A full single-color tube is off-limits. The buffer freed by the last ferry move becomes your working buffer for the next color.

The trick to fast isolation is overflow routing. When you drain overflow off the target tube, you have to put it somewhere, and where you put it determines how easy the next color will be. The discipline is to route each overflow layer onto a tube whose foundation matches that layer's color — so the overflow move doubles as a foundation-building move for another color. Done well, isolation of one color simultaneously advances the isolation of two others, and a five-color level can collapse in a single smooth sequence.

Pattern 2 — Pipeline

Use buffers to resequence stacks

Pipeline is the pattern you reach for when the overflow you need to drain is itself a clean stack of one color — but in the wrong tube. Picture a tube whose top three layers are all blue, sitting on a red foundation. You want the red foundation exposed, but the blue stack on top of it is perfectly sorted. If you pour the blue stack into a buffer, you have moved a clean stack without disturbing it; the moment you expose and complete the red, you can pour the blue back onto its own foundation in one move.

This is the pipeline idea: an empty tube acts as a temporary holding pen for a clean stack, letting you reach a foundation buried underneath it without scrambling the stack. The stack is preserved, the foundation is exposed, and the stack returns to its home the instant the foundation is cleared. Pipelines are what make levels with deeply buried foundations solvable — without them, you would have to disassemble every clean stack you encounter, which often exceeds your buffer budget.

The pipeline procedure

• Identify the buried foundation: A target color is hidden under a clean stack of a different color. You need that foundation exposed.
• Pour the clean stack into a buffer: Use an empty tube to hold the entire clean stack intact. One move, one preserved stack.
• Complete the now-exposed foundation: Gather the remaining pieces of the foundation color and fill the tube, solving it.
• Return the preserved stack: Pour the buffer back onto its matching foundation elsewhere — often the tube it originally sat above, now empty.

Pipelines become powerful when chained. A single buffer can hold a stack, then hand it back, then hold a different stack, in sequence — provided you never need two buffers at once. The skill is sequencing your pipeline operations so that no two preserved stacks overlap in time. If you ever find yourself needing a second buffer while one is already holding a preserved stack, you have hit a buffer conflict, and the level becomes a cycle problem (covered next).

Pattern 3 — Cycle

Untangle circular dependencies

Cycle is the hardest of the three core patterns and the one that separates intermediate solvers from advanced ones. It appears when three (or more) tubes are mutually entangled: tube A's foundation is buried under blue that belongs in tube B, tube B's foundation is buried under red that belongs in tube C, and tube C's foundation is buried under green that belongs in tube A. You cannot complete any one tube without first completing another, and there is no clean stack to pipeline — every layer is entangled with the next.

The solution is a rotational buffer. Take one empty tube and use it to break the cycle by temporarily parking one layer from each tube in turn, then re-pouring them in a different order. The classic three-tube cycle works like this: park tube A's top layer in the buffer, which exposes A's next layer; pour B's matching layer onto A; park B's now-exposed layer into the buffer; pour C's matching layer onto B; finally, pour the buffer (which now holds A's original top layer) onto C, where it matches. One full rotation untangles all three tubes and leaves each with an exposed foundation.

The cycle procedure

• Identify the cycle: Three or more tubes whose top layers each belong to a different tube in the set. No single tube can be solved without breaking into another.
• Pick a buffer and a starting tube: The buffer holds the first layer you lift off; the starting tube is the one whose top layer you park.
• Rotate one layer at a time: Lift, expose, pour the matching layer from the next tube, lift again. Move around the cycle until every tube has advanced one step.
• Complete the cycle and exit: When the buffer's held layer matches the last tube's now-exposed top, pour it home. The cycle is broken — each tube now has an exposed foundation, and ordinary isolation takes over.

The hard part of cycle solving is recognizing when you are in one. The telltale sign is a board where every tube has a foundation buried under a different color, and chasing any one color's completion keeps cycling you back to where you started. If you find yourself pouring the same layers around in circles, stop and look for the three-tube (or four-tube) loop — identify it explicitly, pick a buffer, and rotate it once. One deliberate rotation collapses the loop and restores forward progress.

Advanced Multi-Column Theory

Prove solvability before you commit

Beyond the three core patterns lies a deeper question: given a particular board, is it even solvable, and if so, how many buffers will it cost? Multi-column theory gives you a way to answer this before you make a single move, by counting colors against the free capacity on the board. This is the difference between solving by instinct and solving by proof — and it is what lets you look at a board and immediately know whether you have enough breathing room.

The core invariant is simple: the number of free slots (empty tube-capacity) must be at least as large as the maximum stack depth of any single color's overflow. In plain terms, if one color has three pieces buried under three layers of other colors, you need at least three free slots somewhere on the board to drain those layers before you can complete that color. If you have fewer free slots than the deepest overflow, the level is not solvable in its current arrangement, and you must restructure first — usually by completing an easier color to free up a tube.

The three pillars of multi-column theory

• Buffer budget: Count total free slots = (empty tubes × tube capacity) + unfilled slots in partially-full tubes. This is your working capital; every pattern spends some of it.
• Overflow depth: For each color, the number of non-matching layers sitting above its pieces. The maximum overflow depth across all colors is the minimum buffer you need to make any progress at all.
• Cycle count: The number of independent cyclic loops on the board. Each cycle costs one buffer to break, and overlapping cycles cost more. Plan your buffer spend around the cycle count first.

With this theory in hand, you can plan an entire level before moving. Walk every color and tag it as "cheap isolation" (low overflow, no cycle), "pipeline" (clean stack buried foundation, one buffer), or "cycle" (entangled, one buffer per loop). Allocate your buffers to the most expensive patterns first — cycles, then pipelines, then isolation. Cheap isolations effectively cost nothing because they free a buffer as they complete. By the time you reach the expensive patterns, your budget should already be augmented by the buffers freed from the cheap ones. This is how advanced players solve 12-color boards in under 20 moves with confidence rather than luck.

Move Optimization & Hard-Level Walkthrough

From solvable to minimal

Once you can solve any board, the next goal is solving it in as few moves as possible. Move optimization is not about cleverness — it is about eliminating waste. Most players use 50–100% more moves than necessary because they pour layers they will immediately have to re-pour, or they complete colors in an order that forces redundant buffer traffic. Optimization is the art of sequencing so that every pour contributes to a permanent completion.

The four optimization rules

• Never pour a layer twice: If a layer will have to be moved again before its color completes, find a different route. A pour that is immediately undone is a wasted move.
• Complete colors in ascending order of overflow depth: Cheap colors first free buffers early, reducing the overflow depth of harder colors before you tackle them.
• Combine isolation and pipeline: Whenever possible, route overflow onto a tube whose foundation matches it — one move advances two colors.
• Defer the cycle until last: Cycles are buffer-intensive. By the time you reach the cycle, the cheap colors should have freed enough buffers to break it in a single rotation.

Hard-level case study: the 5-color deadlock

Consider a classic hard board: five colors, six tubes, no empty tube to start. Two of the colors form a clean two-tube cycle (each buries the other's foundation), while the remaining three colors are cheap isolations with one or two overflow layers each. A reactive solver pours the cycle layers around fruitlessly and burns out. An optimized solver completes the three cheap isolations first — three colors solved, three tubes freed, three new buffers available. The remaining two-tube cycle now has ample buffer to break in a single rotation: park one layer, expose a foundation, pour the matching layer home, return the buffer. Total moves: roughly 14, where a reactive solver would take 30+ and might never finish.

Hard-level case study: the 7-color scramble

A harder variant: seven colors, eight tubes, one empty buffer to start, with three interlocking cycles among the deeper colors. Here the cycle count exceeds the initial buffer budget — theory says it is unsolvable as arranged. The solution is to complete the two cheap isolations first (the colors with single-layer overflow), which frees two additional buffers, taking the budget from one to three. Now the three interlocking cycles can each be broken with one rotation, in sequence. The lesson generalizes: when a board looks impossible, complete cheap colors to manufacture buffers, then break the cycles in dependency order.