Dominoes I
(Published on 2. June 2017, 14:02 by zorant)
Rules:
Rules: Given domino pieces have been arranged together, and afterwards the borderlines between the pieces have been removed. Reconstruct the missing lines so that every domino piece exists exactly once in the grid.
Rules: Given domino pieces have been arranged together, and afterwards the borderlines between the pieces have been removed. Reconstruct the missing lines so that every domino piece exists exactly once in the grid.
Solution code: Solution code: Enter the number horizontally dominoes in every row from top to bottom.
Solved by dm_litv, zhergan, CHalb, jessica6, Zzzyxas, Matt, marcmees, jirk, ch1983, Nothere, Toastbrot, deu, saskia-daniela, flaemmchen, tuace, Joo M.Y, zuzanina, ManuH, moss, pirx, Alex, lutzreimer, ... athin, geronimo92, DocLogic, hirassy, misko, Danielle, Raistlen, drolli38, CJK, Dugong, EKBM, Jordan Timm, DK_48, logik66, Eierkopp121, quadrecip, aliciaprobably, drf93, asynchronous, bereolosp
Comments
on 3. June 2017, 08:13 by flaemmchen
@zhergan: Danke!
on 2. June 2017, 17:34 by zhergan
@flaemmchen: Für jede Zeile die Anzahl der waagrecht liegenden Dominosteine, von oben nach unten
on 2. June 2017, 17:19 by flaemmchen
Ich versteh den Lösungscode nicht :-(
Soll ich die Ziffern, die auf den waagerechten Dominos liegen angeben oder die Summe derer??
