ahaicon1 39. A NASTY MATCH PROBLEM backwardarrow1

There are many problems which involve rearranging matches. Here is one which requires some ingenuity, but no trickery.

match1

The 12 matches in the diagram enclose an area of five square units. Our problem is to arrange the matches to form a single simple boundary which encloses an area of four square units.

All the usual rules apply – no broken matches, crossing matches or matches left over.

You might think of solving this problem by forming a long narrow parallelogram for example, but then you would need a ruler to find the exact width. There is a region whose area of four units is easily determined.

Hint 1

 

Solution

Extensions

ROhint1
ROsolution
ROextensions