ColoR Rectangles
(Published on 3. November 2009, 01:18 by zhergan)
Divide the diagram along the grid lines into some rectangles, so that each rectangle contains exactly one colored field. Actually each color corresponds to a number between 2 and 7 which indicates the area of the rectangle. Each grid cell must be part of one rectangle. For an example with numbers you may check the following address: http://wiki.logic-masters.de/index.php?title=Shikaku/en
Solution code: For each line the number of rectangles in this line, from top to bottom
Comments
on 4. November 2009, 10:39 by CHalb
Should this be labeled as a Kryptorätsel instead of a Färberätsel?
edit: OK, has been changed, thanks.
on 3. November 2009, 14:14 by zhergan
@Rollo: The description has changed. That was the thing really I meant. Thanks for warning:)
on 3. November 2009, 13:59 by Rollo
Please change the description to '... contains exactly one coloured field. ...', otherwiese there are some more solutions.
