You are given a grid. Some of the cells in the grid are labelled with positive numbers. You must partition the grid into triangles.
- There must be a triangle for each labelled cell
- Each cell must be completely contained within its triangle
- The vertices of each triangle must be intersection points of the grid
- Every triangle has one (or more) edges that are either horizontal or vertical
- The cell's label specifies the area of its triangle
Here is an example to illustrate the problem.
Observe that the restriction that every triangle must have a horizontal or vertical edge means that it is easy to work out its area. For example the triangle labelled 6
has base length 3 and height 4. So its area is $\frac{1}{2}(3 \times 4) = 6$ as required.
Here are two problems to solve, an easy one for practise and one that requires a little more effort. Both problems have a unique solution.
You can of course solve it any way you like, but I find it easiest to print out the pictures and then draw lines on them using a ruler. There is no need to use a computer - they're not that hard! It would be nice for an answer to specify some of the steps used to find the solution.
I came up this idea myself. I find the restriction on valid triangles gives a nice balance between having too many options and too few options when partitioning the grid. I'm not aware of anyone else having already used the idea, but it wouldn't surprise me if it were not original. But the instances of the problem used here must be original.