Logic Masters Deutschland e.V.

Sliding Rocks

(Eingestellt am 1. September 2009, 01:35 Uhr von yureklis)

Move every black cell one step towards one of the four directions so that when all moves are done, black cells do not touch each other from the sides. Also when all moves are done, all remaining cells should be traversed by a single continuous loop which doesn't cross itself. Numbers outside the grid indicate the amount of blackened cells in the corresponding direction.

Lösungscode: Write the amount of corners in the loop.


Gelöst von pwahs, Alex, Susie, lupo, Luigi, pin7guin, CHalb, Richard, uvo, sandmoppe, Statistica, geibthor, Realshaggy, Thomster, Javier Rebottaro, Le Ahcim, ibag, vkurt, zhergan, rimodech, zorant, joyal, PRW, Mody, pokerke, relzzup, sf2l, ffricke, matter, Joe Average, rubbeng, dm_litv, AnnaTh, tuace, ch1983, Zzzyxas, misko, CJK, EKBM
Komplette Liste

Kommentare

am 1. September 2009, 21:08 Uhr von lupo
MIST!!! Widerspruch auf der Zielgeraden! Trotzdem ein klasse Rätsel!

am 1. September 2009, 20:49 Uhr von Alex
Puuuh! Nur einmal verzaehlt (und schon ganz nervoes geworden, nach all der Arbeit) :D
tricky, tricky!

am 1. September 2009, 17:46 Uhr von Realshaggy
Oh god! How could I not see that? Sorry for my last comment :-)

PS: But I'm still sure that I can pull of some surprising ideas which lead to a solution too.

Zuletzt geändert am 1. September 2009, 17:35 Uhr

am 1. September 2009, 17:33 Uhr von pwahs
I got it!

I liked this type of puzzle. It's a kind of meta-puzzle, because you need to know something, which is not explicitly said in the instructions, but there is an (in my opinion obvious) hint. There is just one problem: There are different ways to realize this idea, you need to try which one works.

But even after having the right idea, I got stuck in the middle of solving - I forgot about the numbers, since I just used the upper diagramm ^^.

Thanks to yureklis for this nice puzzle.

Zuletzt geändert am 1. September 2009, 14:52 Uhr

am 1. September 2009, 14:50 Uhr von Realshaggy
The worse thing is, I'm sure it would have been a very good, not too easy and funny puzzle without a "gimmick". I have around 10 ideas, and I'm sure at least one will lead to a logical solution.

am 1. September 2009, 14:32 Uhr von yureklis
The loop will be a regular closed loop, going through the centers of the cells, visiting each white cell only once and not crossing itself.

am 1. September 2009, 14:04 Uhr von yureklis
The puzzle is based on a simple idea related with the restrictions of a loop puzzle.. When you see this, everything will be ok.

Zuletzt geändert am 1. September 2009, 13:56 Uhr

am 1. September 2009, 13:56 Uhr von yureklis
Blackened cells cannot overlap each other.

Zuletzt geändert am 1. September 2009, 16:04 Uhr

am 1. September 2009, 13:37 Uhr von pwahs
May some of the stones move onto the same field, e.g. in the right upper corner from +13 and L14 to L13?

am 1. September 2009, 12:20 Uhr von yureklis
Cells S4, S6 and E6 should seem white, there has been a problem in drawing. I'll fix it and replace the picture now.

am 1. September 2009, 12:01 Uhr von Menxar
Firefox and Internet Explorer display the .png differently.
Onlywith IE you see these fields in a light gray.

am 1. September 2009, 11:51 Uhr von annusia
On my sheet the cells S4, S6 and E6 are white too. The only difference is the border of these cells. They are little bit thicker then the other.

am 1. September 2009, 11:44 Uhr von Realshaggy
On my sheet these are white cells, I can't see any difference to other white cells. Looking forward to try it after work, I like those "draw a single closed loop which moves through every cell"-puzzles very much (Route etc.).

am 1. September 2009, 10:55 Uhr von Statistica
I assume, those are the black 'rocks' (to move), the others not (???)

am 1. September 2009, 08:13 Uhr von Luigi
Is there something special with S4, S6 and E6? It appears to me, that the colour is somewhat different.

Schwierigkeit:4
Bewertung:75 %
Gelöst:39 mal
Beobachtet:6 mal
ID:00006D

Wegerätsel Bewegungsrätsel

Lösung abgeben

Lösungscode:

Anmelden