IA idea · Fractals & chaos
A fractal shortcut for the travelling salesman: ordering stops along a Hilbert curve
Research question
If delivery stops are visited in the order they appear along a Hilbert space-filling curve, how long is the route compared with the nearest-neighbour route and a lower bound, for real sets of stops?
Make it yours, then agree it with your teacher.
Next step: plan this IA free — the planner opens with this question filled in. For feedback on your own draft, the IA package (€39 once) gives you 5 AI feedback credits and every annotated exemplar in full.
Why it makes a good exploration
Space-filling curves are a genuine fast heuristic for routing. Comparing them with graph-theory methods links fractals to an applied decision.
The mathematics you'll need
- Constructing the Hilbert curve recursively
- Mapping a point to its position along the curve
- Route length calculations
- Nearest-neighbour and lower-bound methods (AI HL)
- Comparing ratios over many sets of stops
Where the data comes from
Take addresses or landmarks from OpenStreetMap as stops; generate random sets for comparison.
- OpenStreetMap — Free map with exact coordinates of schools, hospitals, shops and stations; export or read off coordinates.
- GeoGebra — Free geometry and graphing software — Voronoi diagrams, loci and regression built in.
Real data for this idea
- Primary source: OpenStreetMap. Read off coordinates (right-click, “Show address”) or use Export for a small area. Licence: Open Database Licence: credit “© OpenStreetMap contributors”; data you build from it must be shared alike.
OpenStreetMap is under the Open Database Licence: credit “© OpenStreetMap contributors”. Links checked October 2026; we link to the data and never copy it. More free data sets.
A possible outline
- Explain the curve's construction.
- Order stops along it and find the route length.
- Compare with nearest neighbour and a lower bound.
- Repeat for many sets of stops.
- Reflect on roads versus straight lines.
Pitfalls that cost marks
- Not explaining how a point's position on the curve is found.
- Comparing on one example only.
- Ignoring road distances in the conclusion.
Showing personal engagement
- Use your own delivery round or paper route.
- Predict which method wins before testing.
- Try a different space-filling curve.
See Criterion C: personal engagement for what examiners look for.
Which course is it for?
| Course | Fit | Maths to lean on |
|---|---|---|
| AA SL | Not a natural fit | The core technique sits in the AI course or at HL; an AA SL student could use it only as clearly explained new mathematics. |
| AA HL | Good fit | Constructing the Hilbert curve recursively; Mapping a point to its position along the curve |
| AI SL | Not a natural fit | The mathematics is mainly AA or HL (calculus or proof beyond AI SL); an AI SL version would need a data-driven, technology-based approach. |
| AI HL | Good fit | Constructing the Hilbert curve recursively; Mapping a point to its position along the curve |
Level: Ambitious. Suits confident students; expect to learn some mathematics on your own. See how the IA differs between AA and AI, SL and HL.
How this idea reaches the top bands
Reflection (D)
For this idea, start with the weak points: not explaining how a point's position on the curve is found; and comparing on one example only. Say how each one affects your answer.
Use of mathematics (E)
HL: constructing the Hilbert curve recursively; mapping a point to its position along the curve; route length calculations; nearest-neighbour and lower-bound methods; comparing ratios over many sets of stops, each explained in your own words and carried out correctly.
How fractals & chaos explorations reach the top bands in general: Fractals & chaos IA ideas. Guides: A · B · C · D · E · self-grade sheet.
Taking it further
Prove a bound on how much longer the curve route can be in the worst case, or compare different curve orders.
Extending it for HL
This idea already has HL mathematics in it: Nearest-neighbour and lower-bound methods. Make that the centre of the exploration and use it with full rigour.
See a complete IA, marked
What is the quickest way to deliver a leaflet to every house on my estate? (AI HL) is a complete fractals & chaos exploration, marked on every criterion.
Frequently asked questions
Which IB Maths course is this IA idea for?
It works for AI HL and AA HL. We rate it Ambitious: it suits confident students, who should expect to learn some mathematics on their own.
What mathematics does this IA use?
Constructing the Hilbert curve recursively, mapping a point to its position along the curve, route length calculations, nearest-neighbour and lower-bound methods (AI HL) and comparing ratios over many sets of stops.
Where can I get data for this IA?
Take addresses or landmarks from OpenStreetMap as stops; generate random sets for comparison. Checked sources and tools: OpenStreetMap and GeoGebra.
Turn this idea into your IA
The planner opens with “A fractal shortcut for the travelling salesman: ordering stops along a Hilbert curve” filled in: the question, the maths and the data sources.
Your plan is kept in this browser. A free account keeps it with your drafts on any device: Join free · Sign in
Also: free IA self-check · A–E checklist (PDF) · have a draft? AI feedback or a review with Pete (€100)
Writing it up: how to write a Maths IA, step by step · structure and format · mistakes that cost marks · annotated exemplars, marked on every criterion
Similar ideas
- How fractal is a fern? Box-counting dimension from photographsAI SLAA SLAI HLAA HLSolid
- From steady to chaotic: the logistic map's period doublingAA HLAI HLAmbitious
- Why does a random game draw the Sierpiński triangle?AA SLAA HLAI SLSolid
- Fold a strip, unfold it: the dragon curveAA SLAA HLSolid
All fractals & chaos ideas · AI HL ideas · AA HL ideas · All 239 IA ideas