Logic Masters Deutschland e.V.

Mehrdeutige Rätsel - Hochhäuser 1

(Published on 11. January 2017, 11:39 by uvo)

A puzzle with numerous solutions is given. Find two solutions that are, according to a specific definition (see below), completely different.

Skyscrapers: Place a digit from 1 to 4 into each cell, so that each digit appears exactly once in each row and column. The digits represent skyscrapers of different heights; the numbers outside the grid indicate how many skyscrapers can be seen in the respective row or column from the respective direction (smaller skyscrapers are hidden behind higher ones).

No cell can contain the same digit in both solutions.

Solution code: For both solutions the marked rows; the solution whose code is lexicographically smaller comes first.

Last changed on on 26. July 2021, 01:24

Solved by pirx, cornuto, ibag, Luigi, tuace, CHalb, lutzreimer, adam001, Statistica, mango, flaemmchen, dm_litv, matter, ch1983, Rollo, KlausRG, moss, Alex, derwolf23, pokerke, jirk, Toastbrot, saskia-daniela, ... Julianl, amitsowani, kopfball, Realshaggy, Kekes, Krokant, Mystoph, athin, Madmahogany, SKORP17, misko, ropeko, SudokuExplorer, Ours brun, Greg, Raistlen, CJK, Dugong, Feadoor, EKBM, Jordan Timm
Full list

Comments

on 17. October 2020, 18:46 by SudokuExplorer
Interesting concept!

on 21. January 2017, 16:01 by uvo
Ich hab grad Roland am Telefon von diesem Rätsel hier erzählt, daraufhin hat er es direkt mal im Kopf gelöst...

Last changed on 12. January 2017, 16:58

on 11. January 2017, 14:17 by Statistica
Mit der letzten Bedingung sind solche mehrdeutigen Rätsel auch schön logisch lösbar :-). Bin gespannt auf etwaige Nachfolger.

on 11. January 2017, 12:19 by ibag
Lustige Idee jedenfalls!

on 11. January 2017, 11:47 by uvo
Vor einiger Zeit hatte ich angefangen, einen Wettbewerb aus solchen mehrdeutigen Rätseln zu erstellen. Mittlerweile denke ich, diese Rätsel sind hier im Portal besser aufgehoben.

Das kleinere Rätsel war ursprünglich als Beispiel gedacht.

Difficulty:1
Rating:87 %
Solved:102 times
Observed:4 times
ID:0002J7

Puzzle variant Multiple solutions

Enter solution

Solution code:

Login