Logic Masters Deutschland e.V.

November Stadtbau Monat (4) - Longest piece loop

(Published on 23. November 2012, 12:00 by Richard)

November City construction Month (4) - Longest piece loop

Place all buildings in the grid. Buildings may be rotated and mirrored. They may not touch each other, not even diagonally. All unused cells form a single, closed loop. Digits on the right and below the grid are the number of cells used by buildings. Digits above and on the left of the grid indicate the length of the longest piece of the loop in the corresponding row or column, measured in whole cells. In cells containing a small black dot the loop makes a 90°-angle.

Solve online in Penpa+ (thx Nick Smirnov!)

puzzle:

Solution code: The number of knicks in the loop; row by row, top to bottom. (Example: 40244444)

Last changed on on 15. October 2022, 06:45

Solved by Luigi, relzzup, zuzanina, rimodech, sloffie, uvo, pin7guin, lupo, r45, MiR, ildiko, Statistica, pokerke, pirx, Thomster, Mody, joyal, Hansjo, saskia-daniela, Zzzyxas, RALehrer, ch1983, Toastbrot, ... flaemmchen, Ute2, StefanSch, flooser, NikolaZ, CHalb, Oskama, PRW, Eisbär, sf2l, tuace, Joe Average, rob, Uhu, Matt, mango, moss, skywalker, misko, EKBM, Nick Smirnov, Mark Sweep, Echatsum
Full list

Comments

on 15. October 2022, 06:45 by Richard
Added link and tag for online solving. Thx Nick!

on 3. September 2022, 16:14 by Nick Smirnov
Penpa:
https://tinyurl.com/2gonmg36

on 7. March 2013, 18:07 by flaemmchen
@Richard: Ich finde die Beispiele sehr hilfreich :-))

on 6. December 2012, 00:00 by ibag
Geniales Rätsel! Für mich das schönste in der Serie.

on 24. November 2012, 17:30 by Richard
When I added the missing building (which was not a factory, but a park) I didn't have the original image available, so I put the extra image underneath the original one. Now I have uploaded new images, English as well as German, so finally, I hope the puzzle is completely correct now. Being busy with puzzles for DSM2013, this theme-month and two other large puzzle projects at the same time is not good for focusing...

Sorry for the inconvenience and: happy weekend! :-)

on 24. November 2012, 17:26 by Richard
New images with the complete set of buildings uploaded.

on 24. November 2012, 16:13 by Dandelo
At least reading the discussion should put the focus on the problem.

And it took me just two or three minutes to find a contradiction and re-read the rules.

The bigger problem for me resulted from copying the puzzle into gimp and solving it on the screen instead of printing and solving on paper.

I didn't notice that the added factory was in an extra png and therefore tried to solve it without it.

Last changed on 24. November 2012, 13:16

on 24. November 2012, 13:16 by Richard
Part of the inspiration for this puzzle comes from two puzzles of Serkan Yurekli (
http://www.logic-masters.de/Raetselportal/Raetsel/zeigen.php?id=0000OP) and (http://www.logic-masters.de/Raetselportal/Raetsel/zeigen.php?id=0000OO) where there was some discussion about the length of the segments. Just to avoid that discussion here with my puzzle too, I decided to put the length as complete cells. But obviously, it didn't get much clearer. Writing proper instructions to puzzles is not always as easy as it looks. Thanks to Claudia I have precised the instructions this morning. I hope everything is clear with the addition.

Last changed on 24. November 2012, 12:25

on 24. November 2012, 12:23 by Dandelo
Yes, I've read the rules and seen the example. But the problem was later to see the 0, which makes clear that a vertical line passing this row is counted as 0. Then the (wrong) conclusion is, that a piece of length one (i.e. 2 cells) is counted as 1.

I agree with uvo that your counting is inconsistent, since there are segments of length 0 and 2, but length 1 is impossible.
In case 0 you count the segments, in case >0 you count the cells.

The other mistake was to copy the puzzle and the pieces into gimp without noticing that there are three pictures.

on 24. November 2012, 12:09 by pokerke
@Richard: I always start by solving the example, and I love it that there are two puzzles for me in stead of one. It's the best way for me to make sure I correctly understood the rules. I then also didn't have a problem understanding the zeroes thanks to the example.

on 24. November 2012, 11:37 by Richard
Once again, I wonder if it makes sense to provide an example to a puzzle. The example also contains a zero on the left side and it is obvious that the loop has to go through that row, since the row above has a positive value, meaning the loop passes through row 1. Besides: it has to go through row 1, since no buildings with a height/width of 12 is to be placed.

on 24. November 2012, 10:38 by Dandelo
Aargh,

erst habe ich die Regeln nicht genau gelesen und die 0 so interpretiert wie uvo (und damit alle anderen Zahlen knapp daneben, ich finde es immer noch nicht gelungen) und dann habe ich mir das Bild ohne die Fabrik in Gimp kopiert....

Naja, erst mal Pause, aber die Idee ist trotzdem sehr schön,

on 24. November 2012, 07:11 by Richard
Anleitung präzisiert. Danke an Claudia.

on 24. November 2012, 00:15 by pin7guin
Die Zahl gibt ja an, wie viele ZELLEN am Stück höchstens verwendet werden.
Es gibt in Zeile 2 zwar keine HORIZONTALEN Wegstücke, aber die Null (ohne die Angabe der 8 Gebäudeteile...) könnte suggerieren, dass sich in Zeile 2 GAR KEIN Wegstück befindet.
Vielleicht hilft eine Präzisierung in der Anleitung: "Die Zahlen oben und links geben die Anzahl verwendeter Zellen des längsten horizontalen (bei Zeilen) bzw. vertikalen (bei Spalten) Stücks des Rundwegs in der entsprechenden Zeile oder Spalte an."

on 23. November 2012, 22:00 by Statistica
But: How does a loop go, if there is a '1' as the longest loop segment?

on 23. November 2012, 18:44 by Richard
@uvo: I think not, since there is no horizontal loop segment in the second row.

on 23. November 2012, 17:35 by uvo
Ich finde die 0 am linken Rand etwas inkonsistent - sollte das nicht eher eine 1 sein?

Difficulty:3
Rating:94 %
Solved:60 times
Observed:6 times
ID:0001KH

Puzzle variant Online solving tool Path puzzle

Enter solution

Solution code:

Login