The 153 domino pieces from 0-0 to 16-16 have been arranged to form a rectangle with size 17x18; after that the borderlines between the pieces have been removed. Reconstruct the missing lines so that every domino piece exists exactly once in the diagram. 16 line segments are already given in the diagram.
Solution code: Give the orientation of the 17 domino pieces containing same numbers starting with 0-0 and ending with 16-16; followed by the orientation of the domino pieces occupying row 16 from left to right. Use H for horizontally oriented pieces and V for vertically oriented pieces.
!!Important note!!: For the second part of the solution code please take into consideration the whole domino pieces occupying row 16 not individual number fields (e.g. there won't be 18 H or V values entered for this part). In other words enter only one H for two number fields forming a horizontally oriented domino lying in row 16.
on 16. October 2010, 06:53 by Richard
Even solving in Excel, using colours, this one is nerve-breaking! But in the so-muchth effort, finally through!
on 13. October 2010, 12:34 by flaemmchen
Das war eine Fleissarbeit :-))
on 18. June 2010, 18:55 by Realshaggy
The puzzle is just big, not hard. The solution code is very bad.
on 12. June 2010, 00:15 by Luigi
@Alex: Glückwunsch zum 700. gelösten Rätsel!!!!
on 8. June 2010, 13:50 by Luigi
Viel Konzentrationsarbeit notwendig!
Vielleicht solltest Du in der Lösungscodeangabe explizit darauf hinweisen, dass dieser sich auf die ganzen Steine und nicht auf die einzelnen Felder der Zeile 16 bezieht.
@Luigi: Hi Peter, you're right. The second part of the solution code was unclear. I added an explanatory note. I hope it is more clear now. Thanks for notifying this.
Zafer
on 8. June 2010, 08:32 by zhergan
Hi to all,
The solution code of the puzzle has changed. First it was as in the puzzle Domino12. I've decided to add something (the content of row 16 also). Sorry entering the solution will also be very tiring after dealing with this huge grid. Thanks in advance to puzzlers who will try to solve this one for their patience.
Zafer