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 first step in covering a square canvas with non-overlapping rectangles?

What is the significance of using unique rectangles in this challenge?

How do you calculate the score based on the areas of the largest and smallest rectangles?

What strategy can be used to achieve a lower score when dividing a canvas?

Why is it important to consider the total area of the canvas when selecting rectangles?