How To Solve A Heyawake Puzzle Step By Step
Heyawake is a Japanese logic puzzle built around shaded and unshaded cells, room boundaries, and strict visibility rules. At first glance, its irregular regions can seem harder to read than a standard grid, but every rule creates useful restrictions that gradually reveal the solution.
The aim is to shade some cells so that no two shaded cells share an edge, every unshaded area remains connected, and numbered rooms contain exactly the stated number of shaded cells. In addition, a straight line of unshaded cells cannot pass through more than two rooms without being interrupted by a shaded cell.
The best approach is systematic rather than intuitive. Mark certain cells, record forbidden cells, and repeatedly scan rows, columns, and rooms for consequences. This method works for casual practice as well as tournament-style solving, where clear notation and speed matter.
Learn The Rules Before Marking Cells
A Heyawake board is divided into rooms by thick borders. Some rooms contain numbers, while blank rooms may contain any number of shaded cells allowed by the other rules. A numbered room showing 2, for example, must finish with precisely two black cells.
Shaded cells may touch diagonally, but they may never touch horizontally or vertically. All white cells must form one connected region through shared edges. The visibility rule is especially important: in any uninterrupted horizontal or vertical line, white cells may cross at most two rooms. If a third room would be entered, a black cell must block the route.
Treat the thick borders as information, not decoration. They determine where a line of sight enters a new room, and they also separate the cell groups used for counting.
Start With Certain Black And White Cells
Look first for a numbered room whose required shading is obvious. A room with a single cell and the number 1 makes that cell black. A room with number 0 makes every cell in the room white. If a room has exactly as many cells as its number, all of them must be shaded, although this often immediately exposes a contradiction with adjacent rooms and should be checked carefully.
Whenever a cell becomes black, mark its orthogonal neighbors white. This prevents accidental side contact and often solves narrow rooms. When a numbered room has already received its full quota of black cells, mark every remaining cell in that room white.
Use small dots or light marks for white deductions and a distinct symbol for black cells. Consistent notation prevents a common error: treating an unmarked cell as though it had already been proven white.
Use Room Counts And Adjacency Together
Suppose a room needs two shaded cells and one of its cells has already been fixed as black. The remaining cells can hold only one additional black square. If two possible positions are each adjacent to the same white or black restriction, compare them as a group rather than deciding too early.
A black cell also creates a cross of white cells around itself. In a tight corridor, those white cells may force the rest of a room to carry its remaining black count. Likewise, if every possible location for a room’s final black cell lies in one row or column, that line can produce a visibility deduction.
When a room is almost complete, count possibilities instead of scanning randomly. Ask how many black cells are still needed, where they can legally fit, and which cells are excluded by neighboring marks. This simple inventory is often the fastest route through the middle game.
Read Long Lines Through Multiple Rooms
The no-three-room rule rewards careful horizontal and vertical scanning. If a continuous white path would pass through three rooms, at least one cell along that path must be black. If two of those rooms already contain fixed white cells that connect across a border, the third room may reveal a forced black position.
A useful pattern appears when a room can be crossed only through one narrow cell. If that crossing would create a third visible room, the narrow cell must be shaded. Conversely, if every possible blocker would isolate a white region or violate a room count, the line must remain open and another deduction follows.
After each significant placement, rescan the full row and column rather than only the nearby cells. The following comparison captures the main purpose of each check:
| Puzzle feature | What to inspect | Typical deduction |
|---|---|---|
| Numbered room | Required black-cell total | Fill or exclude remaining cells |
| Black cell | Orthogonal neighbors | Mark those neighbors white |
| Three-room sightline | Continuous white cells | Force a blocker |
| White connectivity | Separated white regions | Reject isolating placements |
| Nearly full room | Remaining legal positions | Place the final black cells |
Protect White Connectivity
The connected-white rule is easy to overlook because it may produce deductions far from the original room. Before shading a cell, imagine the white cells that would remain around it. A black chain can divide the board into separate white islands, making that placement impossible.
You do not always need to prove a complete separation. If a region has only one possible doorway to the rest of the board, that doorway must stay white. Marking it black would isolate the region, so the cell is forced white. This is particularly useful near corners, narrow corridors, and thick room boundaries.
Connectivity can also settle ambiguous pairs. If two candidate black cells would each block a different route, compare the resulting white network. A legal solution must preserve one continuous white area, so the candidate that cuts off an enclosed section can be eliminated.
Work In A Reliable Solving Order
A disciplined sequence reduces guesses and keeps deductions visible. Begin with room counts, continue with black-cell neighbors, then inspect sightlines and connectivity. Repeat the cycle whenever a new cell is fixed.
For regular practice, short warm-up puzzle sets can build speed in recognizing these patterns before tackling denser boards. Time yourself only after your notation is reliable; fast incorrect marking is harder to repair than slow, transparent solving.
Useful habits include:
- Scan every numbered room for completed or impossible counts.
- Mark all orthogonal neighbors immediately after placing black.
- Check rows and columns whenever a room gains a new fixed cell.
- Test suspicious black placements against white connectivity.
- Record contradictions clearly instead of erasing the reasoning behind them.
Finish With A Full Verification
When the board appears complete, verify every rule independently. Count black cells in every numbered room, check that no orthogonally adjacent black pair exists, and trace the white area from one corner to confirm that every white cell is reachable.
Finally, inspect each uninterrupted row and column for the three-room limit. A puzzle can satisfy all room counts and still fail because of one hidden sightline. This final scan is especially valuable when several deductions were made close together.
With practice, Heyawake becomes a conversation between local and global logic: room numbers control small areas, while visibility and connectivity control the whole board. Open a puzzle, apply the sequence above, and keep a clean record of each deduction until the last uncertain cell resolves.