Hashikabe #4
(Published on 3. March 2026, 19:04 by Nell Gwyn)
- 1. Shade some cells (representing "water") such that:
- 1a. The water cells form a single contiguous region, with no 2x2 areas.
- 1b. Each orthogonally-connected group of unshaded cells (or "island") contains exactly two numeric clues (the two clues may occupy the same cell, indicated with smaller numbers in the corners of a cell), and one of those clues is the number of cells in that island.
- 1c. All numbers are part of islands.
- 2. The other clue in each island is the number of bridges connecting that island to other islands.
- 2a. A bridge is a straight line from a cell on one island to a cell on another island, with only water cells in between.
- 2b. Bridges cannot turn, cannot cross one another, and cannot start or end on the same island cell as another bridge.
- 2c. The bridges must join all the islands into one connected network.
- 2d. Each pair of islands can have at most 2 bridges connecting them directly.
- 3. Some number clues have been replaced with question marks. These may represent any number.
Solution code: Row 8, notated as follows: A = Island cell with a bridge, B = Island cell with no bridge, C = water cell with a bridge, D = water cell without a bridge (in the 7x7 example puzzle, row 4 would be written as CDACABB)
Solved by Fusce, Jesper, AzureFire, MaizeGator, Mr_tn, webato, misko, Agent, Ambrose, Grausbert, ns08, ralphwaldo1, JustinTucker, jkuo7, puzzler05, AnnaTh, dogfarts, SKORP17, Torvelo
Comments
on 6. March 2026, 04:52 by Ambrose
Very nice, not as hard as expected
on 6. March 2026, 04:33 by Agent
Great connectivity logic!