Nanro
(Published on 2. July 2018, 09:38 by uvo)
Place numbers into some cells, so that each region contains at least one number. Within each region, all numbers must be the same and equal to the number of numbers within that region.
All numbered squares must be orthogonally connected, and there can be no 2x2 square (within a region or spanning multiple regions) where all four cells contain numbers. Identical numbers in different regions can not be orthogonally adjacent.
All numbered squares must be orthogonally connected, and there can be no 2x2 square (within a region or spanning multiple regions) where all four cells contain numbers. Identical numbers in different regions can not be orthogonally adjacent.
Solution code: For each row from top to bottom the length of the longest continuous group of numbered cells.
Solved by deu, adam001, pirx, Statistica, jessica6, dm_litv, Luigi, cornuto, CHalb, ibag, r45, jirk, rob, Mody, Nothere, Zzzyxas, marcmees, zorant, Joe Average, Matt, bob, JonaS2010, Rollo, Toastbrot, sf2l, ... Incurrsion, Matthew Humphrey, wisty, Terrapin, yusuf17, Javier Rebottaro, Elytron, hirassy, drf93, helle, Jastucreudo, asynchronous, sniffingstuffs, kousek-nebe, LolaK, kangaroo, Tws, aliciaprobably
Comments
on 10. December 2025, 23:23 by Tws
Das war für mich das erste Rätsel dieser Art. Und ich hab es auf die klassische Art gelöst. Als ich dann die versteckten Kommentare zu Gesicht bekam dämmerte mir, dass man hier vielleicht doch ein wenig analytischer mit kleiner Kopfrechnung blitzschnell zum Ziel kommt. Diese Idee packe ich sofort in meine private Lösungsalgorithmusdatenbank. Danke für die Erhellung!
on 1. June 2022, 12:07 by drolli38
sehr schöne Abwechslung, danke!
on 23. September 2020, 18:24 by Semax
Solche Entdeckungen mag ich!
