LM-Quali-Nachschlag: 4er-Schlange
(Published on 16. May 2014, 22:06 by Semax)
Draw four different snakes into the diagram, each starting at one of the four corners and all ending in the middle. A snake may not touch itself, not even diagonally. Different snakes are allowed to use neighboring cells, but the middle point is the only common point. All snakes have to have the same length, but the length is unknown.
A number outside indicates the amount of cells visited by snakes in this row or column.
A number outside indicates the amount of cells visited by snakes in this row or column.
Solution code: For every row the length of the longest horizontal snake part. (0 for rows without horizontal parts.) (In the middle row the two parts left and right of the middle point count together.)
Solved by matter, PRW, pirx, tuace, lupo, zuzanina, r45, AnnaTh, zorant, Luigi, pokerke, rob, Zzzyxas, ch1983, HaSe, Alex, Mody, ibag, fridgrer, uvo, sf2l, relzzup, derwolf23, dm_litv, NikolaZ, KlausRG, saskia-daniela, pin7guin, sandmoppe, Joe Average, jessica6, ildiko, misko
Comments
on 2. June 2014, 17:18 by ibag
Klasse! Ich hab ewig gebraucht um die Argumente zu finden.
on 25. May 2014, 19:02 by Semax
Hinweis zum Lösungscode:
Schlangen sind bei mir dünne Linien (auch wenn die "nicht berühren"-Bedingung etwas anderes erwarten lässt). Dementsprechend ist die Länge eines Abschnitts gleich der Anzahl der vom Abschnitt benutzten Felder minus 1. Außerdem zählen dadurch zwei in einer Zeile nebeneinander liegende Abschnitte verschiedener Schlangen einzeln.
