Hard Nurikabe puzzles are tightly constrained grids where every white island must match its number, every black wall must connect, and no 2×2 block may be completely black.
That combination—not arithmetic—creates the difficulty: a plausible island can cut off a wall route, while one extra wall can create a forbidden square. For a hands-on compact implementation, play Nurikabe. It is one original 4×4 board with a mechanically verified unique solution, not a graded collection of hard puzzles. The fixed size also makes it focused rule practice rather than a large, adversarial grid.
Why tight Nurikabe grids are hard
Nurikabe is a partition problem in which the numbered white islands and the black wall compete for the same cells. Each number constrains an entire orthogonally connected white component, while every black cell must remain part of one continuous wall. A solve can look correct around one clue yet fail elsewhere because a wall has become isolated or a 2×2 square has filled up.
The practical response is to keep uncertain cells marked unknown, expand only deductions that are forced, and check both local and global constraints before committing to a complete grid. This matters in the linked game because every editable cell must eventually be explicitly identified as wall or island.
Rules that constrain every mark
These are the standard definitions summarized by Nikoli's Nurikabe rules and Conceptis Puzzles' Nurikabe rules.
| Constraint | What must be true | Deduction it supports |
|---|---|---|
| Exact island area | Each orthogonally connected white island contains one clue and exactly that many cells. | A number limits the whole connected white group, not just the cells beside it. |
| One connected wall | Every black cell belongs to one orthogonally connected wall. | A disconnected black pocket invalidates an otherwise plausible grid. |
| No black square | No 2×2 region can contain four wall cells. | A 2×2 region is forbidden only when all four of its cells are walls. |
| Diagonal separation | Corner-touching cells do not form an orthogonal connection. | Two separate islands may legally touch at a corner. |
The strongest local deduction usually comes from the smallest number. A clue 1 has no room for a neighboring island, so all of its existing orthogonal neighbors must be walls. Larger clues then need both careful area expansion and protection of a continuous route for the remaining wall.
Solve the 4×4 board from clue 1
The following route uses row-and-column coordinates, with the upper-left cell written as (1,1). It demonstrates the branch-by-branch reasoning used on difficult Nurikabe grids.
- Locate the fixed clues. The board contains a 2 at (1,1), a 1 at (2,3), and a 5 at (3,4). These numbered cells are fixed white islands and cannot be changed.
- Resolve the 1 immediately. Mark (1,3), (2,2), (2,4), and (3,3) as walls. Each is orthogonally adjacent to the 1, so making any of them an island would enlarge that clue's component beyond one cell.
- Extend the 5. With (2,4) and (3,3) already walls, the 5 at (3,4) must extend through (4,4), then (4,3), then (4,2). Mark those three cells as islands. The 5 still needs exactly one more island cell, and its only possible final extension is (3,2) or (4,1).
- Limit the 2 to two choices. The 2 at (1,1) needs one partner. That partner must be either (1,2) or (2,1); making both islands would create a three-cell component.
- Eliminate (1,2) as the 2's partner. If (1,2) is an island, (2,1) must be a wall. If the 5 extends to (3,2), the wall cells surrounding those choices form a disconnected group. If the 5 instead extends to (4,1), then (2,1), (2,2), (3,1), and (3,2) form a forbidden all-wall 2×2 square. Both possibilities fail.
- Complete the 5's route. The 2's partner must therefore be (2,1), leaving (1,2) as wall. The wall at (3,3) can reach the main wall only through (3,2), because its other orthogonal neighbors are fixed or established islands. Mark (3,2) as wall, which forces (4,1) to be the 5's fifth island cell and (3,1) to be wall.
- Mark and verify the remaining cells. The final island cells are (1,1), (2,1), (2,3), (3,4), (4,1), (4,2), (4,3), and (4,4). The other eight cells are walls. Check the complete board only after every editable cell has an explicit state.
Mark hard-puzzle deductions without losing options
The Lizely interface makes the distinction among wall, island, and unknown visible. Black fill represents a wall, a light cell with a centered dot represents an island, and a blank light cell remains unknown. That explicit system is useful when a larger grid contains several competing deductions.
| Action | Mouse or touchscreen | Keyboard |
|---|---|---|
| Move and edit | Tap an editable cell to cycle unknown, wall, island, then unknown. | Use Arrow keys to move the visible cursor. |
| Mark wall | Cycle to Wall or use the dedicated Wall control. | Press W or Space. |
| Mark island | Cycle to Island or use the dedicated Island control. | Press I. |
| Clear a mark | Cycle to unknown or use the dedicated Clear control. | Press Delete or Backspace. |
| Check the grid | Select Check board. | Press Enter. |
Numbered cells remain fixed, so the marking commands apply only to editable cells. The shared double-Escape gesture opens the boss screen and returns to the puzzle without exposing the board.
What Check board does with an attempt
Check board distinguishes unfinished work from a completed attempt. If any editable cell is still unknown, the game asks you to continue and records no mistake. Once every cell has an explicit final state, the validator builds the orthogonally connected island components, requires exactly one clue in each with a matching area, checks that all walls form one component, and scans every 2×2 window for an all-wall block.
The first wrong complete board records one mistake but remains editable, allowing you to diagnose and repair it. A second wrong complete check deadlocks the run until Restart is selected. A correct complete board awards exactly 1,000 points. Completion and deadlock are terminal states, so later marks, cursor movements, and checks cannot change the frozen result.
Restart clears every non-clue mark, restores the three fixed clues, returns the cursor to the first editable cell, and resets the score and mistakes. The board's uniqueness was established separately by an exhaustive test of all 8,192 assignments of the 13 editable cells; exactly one assignment satisfies every rule.
Scope and limits of this Nurikabe challenge
This version presents one original Lizely fixture, not an official Nikoli or Conceptis puzzle and not a pack of graded hard boards. It has no daily-puzzle download or difficulty selector. The entire game runs locally in the browser, sends no board state to a server, requires no account, and uses no random generator.
Because the board is fixed, replaying it can become easier through memory. Completion time is therefore intentionally excluded from scoring, and the 1,000-point result is a recreational score rather than a measure of intelligence, health, education, or employment suitability.
A final audit for any Nurikabe solve
- Confirm that every orthogonally connected white component contains exactly one clue.
- Compare each component's cell count with its clue value.
- Trace all wall cells together and reject any separate black pocket.
- Inspect every 2×2 square for four walls.
- Allow diagonal contact between separate islands, but never mistake it for an orthogonal connection.
- Give every editable cell an explicit state before checking the completed grid.
Related reading: Avoid Common Mistakes in Painted Cube Puzzle.
Related reading: Fold to Shape Puzzle Guide: Map Every Reflection.