26.11.2009, 12:20
ABCD, HEYAWAKE, CITY RING (Points: 50+5)
ABCD: Fill the diagram with the four symbols: House, Tree, Road and Empty. Same symbols cannot touch each other by the side (that means: orthogonally). The numbers outside the diagram indicate how many of these symbols occur in the corresponding row or column. Not all numbers are given.
Heyawake: Fill some fields in the diagram with trees. Trees cannot touch each other by the side (that means: orthogonally). All other fields must be orthogonally connected (i.e. the trees do not divide the diagram in two or more parts completely separate). There are no more than two marked regions allowed without a tree. That means: If you look horizontally (or vertically) and you have three or more marked regions in a line (without a tree) you are wrong.
City ring: Draw a closed loop in the diagram. This loop uses exactly once each field with a Road and with a House. In every field with a House the loop makes a 90 degrees turn. The loop cannot pass through empty field and fields with trees.
Solution code: The 2. and the 8. (2. from bottom) row: H for a House, B for a Tree, W for a Road, and L for an empty field.
The solution code for the example would be: WBWHWHLWHWHL
ABCD: Fill the diagram with the four symbols: House, Tree, Road and Empty. Same symbols cannot touch each other by the side (that means: orthogonally). The numbers outside the diagram indicate how many of these symbols occur in the corresponding row or column. Not all numbers are given.
Heyawake: Fill some fields in the diagram with trees. Trees cannot touch each other by the side (that means: orthogonally). All other fields must be orthogonally connected (i.e. the trees do not divide the diagram in two or more parts completely separate). There are no more than two marked regions allowed without a tree. That means: If you look horizontally (or vertically) and you have three or more marked regions in a line (without a tree) you are wrong.
City ring: Draw a closed loop in the diagram. This loop uses exactly once each field with a Road and with a House. In every field with a House the loop makes a 90 degrees turn. The loop cannot pass through empty field and fields with trees.
Solution code: The 2. and the 8. (2. from bottom) row: H for a House, B for a Tree, W for a Road, and L for an empty field.
The solution code for the example would be: WBWHWHLWHWHL