Bouncing Around

(Published on 11. September 2022, 18:58 by actinide)

This is a simple hitori puzzle.

Rules:

Shade some numbers in the grid so that there are no two identical unshaded numbers in a row or column.
Shaded cells cannot be adjacent.
All unshaded cells must form a single orthogonally connected region.

Solution code: The solution is the list of shaded digits in row 3, row 5 (left to right), column 5, and column 8 (top to bottom) in that order.

Last changed on on 27. February 2023, 21:39

Solved by Steinway1867, moeve, Dandelo, zorant, Zzzyxas, CHalb, CJK, Greg, cdwg2000, h5663454, saskia-daniela, adam001, ffricke, jessica6, peep50183, misko, Ofri, Uhu, Raistlen, Rollo, Nylimb, moss, rcg, ... Tug, Polytechnisch, Dez256, yusuf17, Javier Rebottaro, Across, puzzler05, Haenschweiller, pillowss, hirassy, Andreas.vm, Jrgamer4u, Srinidhi Kabra, gsansone, Overhead, bereolosp, geronimo92

Full list