TED-Ed: Can you solve the Mondrian squares riddle? - Gord Hamilton

The video tutorial presents a mathematical challenge of covering a square canvas with unique, non-overlapping rectangles. The goal is to minimize the score, calculated by subtracting the area of the smallest rectangle from the largest. Examples with 4x4 and 8x8 canvases are explored, demonstrating strategies to achieve lower scores. The tutorial emphasizes the importance of intuition and experimentation, as there is no formulaic solution. The challenge extends to larger grids, inviting viewers to try their own solutions.

What is the main goal when covering a square canvas with rectangles?

• To achieve the highest possible score

• To achieve the lowest possible score

• To ensure all rectangles are identical

• To use as many rectangles as possible

When dividing a 4x4 canvas, why can't you use both a 1x4 and a 4x1 rectangle?

• They are too large

• They have the same area

• They do not fit on the canvas

• They are not unique rectangles

What is a key strategy for minimizing the score on an 8x8 canvas?

• Using as many rectangles as possible

• Using rectangles with the largest possible area

• Ensuring all rectangles have the same area

• Keeping rectangle areas within a small range

What happens if you use rectangles with odd areas on an 8x8 canvas?

• You must use another odd-value rectangle to maintain an even sum

• The score automatically increases

• The canvas cannot be fully covered

• The rectangles will overlap

Why is it challenging to find the lowest possible scores for larger grids?

• There is no known formula

• Rectangles cannot be unique

• The canvas area is too small

• All rectangles must be identical