Decompose
Split a large spatial problem into subproblems.
Learning goals: what you will learn
- explain the central idea: Design, test and refine algorithms or digital procedures for spatial problems, then justify the solution.
- choose and apply an appropriate method without relying on keyword matching
- check results using units, substitution, estimation, a second representation or contextual reasonableness
- justify a conclusion and communicate limitations where the context requires them
Prerequisite knowledge
Revise Cartesian coordinates, transformations, angle and length relationships, scale, basic geometric reasoning and the idea of an algorithm as an unambiguous sequence of steps.
Concept teaching
Computational thinking in spatial mathematics uses decomposition, abstraction, algorithms and testing. A solution is not finished when it runs once: it must be tested with ordinary, boundary and difficult cases and evaluated against the original spatial constraints.
Algorithm
Finite, ordered, unambiguous steps.
Test
Normal case + boundary case + counterexample/failure case.
Refine
Compare output with constraints; change steps or model and justify why.
Worked examples
1. Scale-model workflow
Define dimensions and scale, generate model, measure output, compare with intended ratio, then adjust if printer/material constraints distort the design.
2. Tessellation puzzle
A valid puzzle piece must repeat without gaps/overlaps under chosen transformations. Test rotations/translations on several placements before printing.
3. Weighted route
Route A weights 3+5+2=10; Route B 4+3+2=9. If weight means travel time, choose B—unless another constraint such as road closure invalidates it.
4. Coverage
For a delivery network, a shortest route is not enough if it misses required vertices. The algorithm must encode both coverage and cost.
5. Store layout decomposition
Break congestion problem into entrances, checkout queue, aisle widths, high-demand displays and evacuation paths. Optimising one region cannot violate another constraint.
6. Pseudocode pattern
Repeat 4 times: draw segment; turn 90°. This generates a square. Changing repeat count or turn angle creates testable conjectures about closure.
7. Self-similar recursion
At each stage replace one segment by a fixed scaled pattern. Validate stage 1,2,3 outputs against the stated scaling rule.
8. Boundary test
An algorithm that places 1 m-radius circles in a 10 m strip works for centre positions 1≤x≤9; testing x=0 exposes an out-of-bound placement.
9. Geospatial layers
A community planning map may combine position, distance, land-use and transformation layers. The spatial question determines which layers matter.
10. Communicate justification
“Route B is best” is weak. “Route B has total weight 9 versus 10 and 13 for alternatives, visits every required vertex and satisfies the closure constraint” is justified.
Common misconceptions and corrections
- Writing vague steps that another person could not execute.
- Optimising one measure while ignoring another requirement.
- Testing only the example used to design the algorithm.
- Confusing a visually attractive digital model with a validated solution.
- Using community/geospatial data without considering context, authority or limitations.
Guided practice
Write an algorithm that reflects any point (x,y) in the y-axis and then translates it 3 units right. Test three points including one on an axis, refine any ambiguous instruction, and state the final coordinate rule.
Teacher check: require a written method choice and one verification step before revealing the worked solution.
Independent practice
- Define decomposition in a spatial problem.
- What makes an algorithm unambiguous?
- Compare route weights 2+8+3 and 5+4+3.
- Why can shortest route fail a coverage problem?
- Name two subproblems in a store-layout congestion task.
- What shape results from repeat 3 [draw; turn 120°]?
- Why test a boundary case?
- Give one refinement after a 3D model fails a size constraint.
- What extra information should accompany a geospatial conclusion?
- Write a one-sentence evidence-based route justification.
Check answers and explanations
- Splitting a complex problem into manageable parts.
- Each step is precise enough to have one intended interpretation.
- 13 versus 12, so second is lower weight.
- It may omit required vertices/locations.
- Examples: queues and aisle widths.
- An equilateral triangle.
- It exposes failures at limits the normal case may miss.
- Adjust scale/dimensions while rechecking constraints.
- Data source, scale, assumptions and relevant uncertainty/context.
- Any statement comparing measured route weights and confirming constraints.
Reasoning and problem-solving task
Design an algorithm for placing four equally spaced points around a circle and connecting them to form a square. Test your method for different circle radii and centres, explain which properties remain invariant, and justify why the output is a square.
Important questions and answers
- Define decomposition in a spatial problem.
- Splitting a complex problem into manageable parts.
- What makes an algorithm unambiguous?
- Each step is precise enough to have one intended interpretation.
- Compare route weights 2+8+3 and 5+4+3.
- 13 versus 12, so second is lower weight.
Assessment-style questions
Design, test and refine an algorithm that generates the four vertices of a square centred at (a,b) with sides parallel to the axes and side length s. Communicate the final coordinate rules and justify that the shape is a square. [7 marks]
Marking focus: method selection, mathematically correct working, interpretation and justification.
Review hints
- state constraints and objective separately
- write reproducible steps
- test normal and boundary cases
- justify invariants mathematically
Exit ticket: mastery check
- I can explain the concept without copying a formula sheet.
- I can solve a routine example and check the result.
- I can choose a method in an unfamiliar problem.
- I can explain a common error and correct it.
- I can connect the answer back to the context, including units or limitations.
Teacher and parent guidance
For teachers
Assess process evidence: algorithm version 1, test cases, identified failure, refinement and final justification. This is richer than grading only the final diagram.
For parents and carers
Ask your child to explain the instructions so clearly that another person could reproduce the design without seeing the original. Ambiguity is the key thing to remove.
Curriculum alignment
Australian Curriculum: AC9M10SP03 — Year 10 Space. Design, test and refine algorithms or digital procedures for spatial problems, then justify the solution.
Victoria: optional Level 10A VC2M10ASP06 closely matches spatial algorithms and digital-tool design; Level 10 geometry/networks provide supporting knowledge
NSW: Stage 5 Paths — Geometrical figures and proof / Introduction to networks, with Working mathematically; no forced one-to-one spatial-algorithm outcome
Alignment explanation: The explicit teaching and worked examples address the Australian Curriculum concept directly. The Victorian mapping follows the current Version 2.0 descriptor structure; where Victoria combines or extends content, that difference is stated rather than hidden. NSW uses a Stage 5 Core–Paths structure, so this page maps to the relevant content group(s) and Working mathematically processes instead of inventing a Year 10 one-to-one code.
| Lesson component | Australian Curriculum | Victoria | NSW |
|---|---|---|---|
| Explicit concept teaching and worked examples | AC9M10SP03 | optional Level 10A VC2M10ASP06 closely matches spatial algorithms and digital-tool design; Level 10 geometry/networks provide supporting knowledge | Stage 5 Paths — Geometrical figures and proof / Introduction to networks, with Working mathematically; no forced one-to-one spatial-algorithm outcome |
| Guided and independent practice | Builds fluency and application for AC9M10SP03 | Practises the mapped Level 10/10A knowledge as applicable | Practises the mapped Stage 5 Core/Path content |
| Reasoning and assessment tasks | Applies reasoning/problem solving in the descriptor context | Supports Victorian reasoning and modelling expectations | Embeds Working mathematically: reasoning, problem solving and communication |
Australian Curriculum elaborations
AC9M10SP03: design, test and refine solutions to spatial problems using algorithms and digital tools; communicate and justify solutions.
- E1: design/make scale models of 3D objects using digital tools, e.g. 3D-printed tessellation puzzle. Examples 1–2.
- E2: computational thinking for network connectedness, coverage and weighted measures; choose efficient routes. Examples 3–4.
- E3: define/decompose spatial problems, apply algorithms, evaluate and communicate, e.g. store congestion. Example 5.
- E4: design/test pseudocode or flowcharts for self-similar patterns and validate with test cases. Examples 6–8.
- E5: explore geospatial technologies used by First Nations Australian communities for position/transformation problems; use authentic community/source material. Example 9.
Practice and teaching resources
Official curriculum references
- Australian Curriculum Version 9 — ACARA
- Victorian Curriculum Mathematics Version 2.0 — VCAA
- NSW Mathematics K–10 Syllabus (2022) — NSW Curriculum/NESA
Official wording is paraphrased on SkillrHub; use the linked curriculum sites as the source of record.
Other curriculum comparisons retained
Closest alignment spans mathematical modelling, networks and computational thinking rather than a single universal code; overlaps US modelling/geometry practices, UK/NZ/Canadian algorithmic spatial problem solving and Australian state digital-mathematics strands.
🎥 Optional Video Lesson
The SkillrHub lesson remains the primary learning resource. This optional video reinforces the explanation; you can complete the lesson and practice without watching.
Before you watch:
- Pause after each worked example.
- Try the examples yourself.
- Return to the SkillrHub lesson before continuing.
Recommended: Dijkstra's Algorithm - Computerphile
Computerphile — Tracing an algorithm to find a shortest route through a weighted network.
As you watch: Why does the algorithm repeatedly compare tentative route lengths?
Load video player Loads YouTube in this lesson. See the video notice below.
Try it: Draw a five-vertex route network, trace the shortest-path steps, then change one edge weight and test whether the best route changes.
Video unavailable, inaccurate or unsuitable for this year? Report a video problem to SkillrHub by email. You can continue with the written lesson and practice resources.
About these videos
Videos are curated from trusted independent educational creators and played through YouTube. Rights remain with their respective owners. Inclusion does not imply that a creator or YouTube endorses SkillrHub.
YouTube’s terms and privacy policy apply to its player. Advertising, recommendations and external links may appear, and videos may change or become unavailable. SkillrHub’s written lessons and practice resources remain available separately.
To report a content, suitability or rights concern, email skillrhublearning@gmail.com with the lesson code and video link. Please do not include personal student information.
Curriculum equivalents: Victoria, NSW and international
Curriculum equivalents for Design, test and refine solutions to spatial problems using algorithms...
Mapped skill: design, test and refine solutions to spatial problems using algorithms and digital tools; communicate and justify solutions
These references identify matching or closely related learning. Curriculum sequence, terminology and depth vary, so teachers should use the mapped skill and lesson difficulty to confirm suitability.
| Region | Curriculum framework | Closest level or code |
|---|---|---|
| Australia | Australian Curriculum v9.0 | AC9M10SP03 · Year 10 |
| Victoria | Victorian Curriculum F–10 Version 2.0 — Mathematics | VC2M10ASP06 · Level 10 |
| New South Wales | NSW Mathematics K–10 Syllabus (2022) | MA5-GEO-P-02 + MAO-WM-01 · Stage 5 |
| United States (USA) | Common Core State Standards for Mathematics | Grades 9–10 band |
| Canada (Ontario) | Ontario Curriculum — Mathematics | Grade 10 |
| United Kingdom (England) | National Curriculum in England — Mathematics | Year 11, Key Stage 4 |
| India | NCERT / CBSE — Mathematics | Class 10 |
Australian Curriculum v9.0 is the canonical source for this SkillrHub lesson. Victoria and NSW entries name the closest published state codes or outcomes; international entries are planning references rather than claims of identical curricula.
Help improve SkillrHub
Questions or feedback?
Ask about this lesson, suggest an improvement or report an error. Facebook opens only when you choose an option below.
Topic reference: AC9M10SP03 — Spatial Algorithms and Design — AC9M10SP03
Privacy: Please don’t share personal student or school information. Younger students should ask a parent, guardian or teacher to post on their behalf.