June 16, 2026. A polemic arguing in favour of creative, open-ended assessment in settings where you want to select for creative, open-ended brains.
Introduction
My favourite undergraduate assignment was for a graph theory course with David Woodβs. The problem was as follows:
Invent a complexity measure for graphs. Prove some nontrivial results about it and compute it for one or two examples.
As opposed to the standard style of questionβimplement Ford-Fulkerson on this graph, prove this result about chromatic number, and so onβit felt like I could take the gloves off.