Finish Creek when every cell, edge, region, and fixed clue satisfies the vertex count connected white completion test. Completion is checked from the entire position, not from a displayed answer or a visual approximation.
Your unfinished game is saved only in this browser.
Finish Creek when every cell, edge, region, and fixed clue satisfies the vertex count connected white completion test. Completion is checked from the entire position, not from a displayed answer or a visual approximation.
Complete guide
Creek uses the independently implemented Creek vertex count connected white rules v1 profile (R640). Creek is defined by one exact interaction: Each vertex clue counts shaded cells in its adjoining block, while every unshaded cell belongs to one orthogonally connected area.
Read the opening of Creek by locating every lane, clue, reserve, room, or fixed element named in its rule. Each vertex clue counts shaded cells in its adjoining block, while every unshaded cell belongs to one orthogonally connected area. The seeded deal and rules version reproduce that public starting information without exposing a hidden completion.
Check each proposed action against the current position and this boundary: Each vertex clue counts shaded cells in its adjoining block, while every unshaded cell belongs to one orthogonally connected area. Illegal, stale, and post-finish actions are rejected without changing the board.
Finish Creek when every cell, edge, region, and fixed clue satisfies the vertex count connected white completion test. Completion is checked from the entire position, not from a displayed answer or a visual approximation. During the final few decisions, compare every unresolved obligation with the target: every cell, edge, region, and fixed clue satisfies the vertex count connected white completion test. Keep the option described in the strategy note available until the last forced dependency is settled.
Start at vertex clues with zero or full capacity, then test whether each forced shade still leaves all currently unshaded cells capable of joining one component. Satisfying every local vertex number independently can isolate a white pocket; connectivity must be preserved while the corner counts are filled.
Start at vertex clues with zero or full capacity, then test whether each forced shade still leaves all currently unshaded cells capable of joining one component. This matters specifically because each vertex clue counts shaded cells in its adjoining block, while every unshaded cell belongs to one orthogonally connected area.
Satisfying every local vertex number independently can isolate a white pocket; connectivity must be preserved while the corner counts are filled. Recheck the legal boundary before choosing a replacement move.
Creek is complete once every cell, edge, region, and fixed clue satisfies the vertex count connected white completion test. The terminal check examines every relevant pile, cell, edge, room, and clue before awarding the result. Undo and redo expose alternative branches without revealing an authored answer.