# Solution to Nurikabe #11

 4 1 1 3 1 2 5 14 2 3 1 3 1 5 5 2 1 14 15 4

### Detailed solution

In the following,

• 'a' denotes a cell which must be white to allow white chain to grow.
• 'B' denotes a cell which must be black to allow black chain to connect.
• 'C' denotes a cell which must be black to provide border for white chain.
• 'D' denotes a cell which must be black to separate two white chains.
• 'e' denotes a cell which must be white to prevent 2-x-2 black square.
• 'F' denotes a cell which cannot be reached by any white chain.

Such deductions which are non-obvious are shown in green with an exclamation mark. In the following "e!" is the cell in a potential 2x2 black square that cannot otherwise be reached from any white chain. Only the 14-chain can prevent a 2x2 black square in the upper right corner: to get there it must go through "a!".
 4 e! C 1 C B C 1 C C 3 C a! C 1 2 5 a C 14 2 3 C C B a C 1 C 3 C 1 C 5 D 5 C 2 C 1 C C 14 15 4

Whichever way the 14-chain breaks up the 2-x-2 black square in the upper right corner, a small black group near the upper right will be isolated and have no way to connect except via the cells "B!" and "F!". Another consequence of the 14-chain's journey to the corner is that it cannot reach the cell "F" (brown) in upper center without exceeding 14 cells. So "F" is black and the cells next to "F" must be white to break up 2-x-2 black squares.

It isn't hard to see that the 14- and 15-chains at the bottom of the board cannot reach anywhere except the cells marked "x", along with at most one of the cells marked "?". This is a total of 33 cells (including the "14" and "15" marks themselves) which must accomodate the 14- and 15-chains and the border between them. The border will contain a minimum of two of the "x" cells, so all but two (33 - 14 - 15 - 2) of the "x" cells will be thusly consumed.
 C 4 a a 1 B C C C C B 1 3 e F e 1 2 5 B! 14 F! 2 F! 3 F! 1 3 1 5 5 x 2 x ? 1 ? x x x x x x ? ? x x x x x x 14 x x x x 15 x x 4 x x x x x x x x x x

Reasoning from the extreme restrictions just described on the large chains at the bottom, we can place most of the border of the 15-chain.
 4 1 1 3 e C C 1 C 2 C a a 5 C B C C C C 14 e 2 e C! 3 1 3 1 5 5 x 2 D x ? 1 ? D! x x x x x x ? ? x x x x B! a a 14 x x D! x 15 x XX D! 4 a a a a x D! x x x x

Just one or two of the "x" cells near the "15" will be black. Using the OWFU ("Only Way for Uniqueness") inference we could eliminate several possibilities. For example the cell marked "XX" cannot be black: if that led to a valid Nurikabe, the same configuration with the cell just above "XX" black instead would be valid and solution would not be unique. Such reasoning would lead to shortcuts in this problem, but I won't use them: Instead I use the standard process which not only finds the solution but proves its uniqueness.

The green "B!" cell at left cannot be white: There would then be an isolated black cell underneath it.
 4 1 1 3 1 2 5 F F 14 2 B! 3 1 3 1 5 5 x 2 B ? 1 ? x x x a a a ? ? x x x x 14 a a x 15 x x 4 a x x x x

 4 1 1 3 1 e 2 5 F F 14 2 a C e e 3 a B 1 3 1 5 5 x 2 1 ? x x x ? x x x x 14 x 15 x x 4 x x x x

The black chain on the left side cannot connect to the right except by using one of the two cells marked in green with "B!" In fact, because of the 5-chain's needs, if either "B!" cell is black, so is the other one.
 4 1 1 3 B! 1 C 2 5 B! 14 2 a C 3 C a a C 1 3 a 1 5 5 x 2 B 1 B x a x a B x x a x 14 x 15 a x 4 x a a x D!

The "e!" inference in the center of the board may not be obvious, but if that 5-chain grows any other way, its neighbor 5-chain won't be able to break up the 2-x-2 black square near "e!". The 14-chain would be able to reach far enough, except that that would starve the 5-chain below it.
 4 1 1 3 1 2 a 5 14 2 e! 3 1 3 1 5 5 D! x 2 1 x x e x x 14 x 15 x 4 x x

The final 5-chain is almost determined by "e!". As shown, this will constrain the 14-chain: It will occupy all the "x" cells in the upper right and one of the "?" cells.
 4 1 x x x x 1 x x 3 ? 1 2 a 5 ? 14 2 C e! x 3 C x C a 1 3 1 5 5 x 2 1 x x x x 14 x 15 x 4 x x

The black chain on the upper right side of the board has only one way ("B!") to connect, shown in green. (This leaves the fifteen cells of the 15-chain completely determined.)
 4 1 a a a a 1 a a B 3 ? 1 2 a 5 ? 14 2 C C a 3 C a C a C a 1 B! 3 1 5 5 B! B! 2 1 x x x x 14 x 15 x 4 x x

Some simple deductions follow, after which there is only one way, shown in green as "B!" to link the black chains.
 4 1 1 3 1 2 a 5 B! 14 2 3 e 1 3 1 5 5 2 1 C a B C 14 15 4