Mehrdeutige Rätsel - Yajilin 1
(Published on 1. February 2017, 10:00 by uvo)
A puzzle with numerous solutions is given. Find two solutions that are, according to a specific definition (see below), completely different.
Yajilin: Shade some empty cells in the grid so that each arrow points at the respective number of shaded cells. Shaded cells can touch diagonally, but not horizontally or vertically. Cells with arrows can't be shaded. Draw a closed loop into the grid, going only horizontally and vertically, that passes through all empty cells (neither cells with arrows nor shaded cells) exactly once.
No cell can be shaded in both solutions.
Solution code: For the marked rows, the lengths of all horizontal loop segments; the solution whose code is lexicographically smaller comes first.
Last changed on on 26. July 2021, 01:28
Solved by moss, Luigi, Uhu, flaemmchen, tuace, CHalb, ibag, zorant, ffricke, Alex, Voyager, hopppe, pirx, Thomster, Rollo, lutzreimer, Statistica, mango, Babsi, ch1983, matter, jirk, ManuH, Zzzyxas, r45, ... admirableostrich, Ninjakuchen, Ulistef, doblei, nmk1218, Drawoon, karzym, kishy72, bakpao, EKBM, TJReds, abadx, patolucatis, jogerth, logik66, Incurrsion, yusuf17, Greg, Javier Rebottaro, drf93
Comments
on 21. September 2018, 11:52 by StefanSch
Hinweis: Im Lösungscode ist die Länge gemessen von Kästchenmitte zu Kästchenmitte gemeint.
on 7. March 2017, 16:29 by uvo
@Lohnecke: Gemeint ist ersteres, von Feldmitte zu Feldmitte gleich Länge 1. Außerdem soll jeder Linienabschnitt separat betrachtet werden, zwei Segmente innerhalb einer Zeile liefern also zwei Ziffern des Lösungscodes.
Aber so oder so scheint mir an deiner Lösung irgendwas noch nicht zu stimmen.
on 1. February 2017, 13:32 by uvo
@Rollo: 1. und 2. sind richtig, also muss der Fehler bei 3. liegen.