Tooltip
These resources have been reviewed and selected by STEM Learning’s team of education specialists for factual accuracy and relevance to teaching STEM subjects in UK schools.
A Level Student Booster - Pathfinding Algorithms (Pre-event materials)
In this online session, you will learn about the different path-finding algorithms. The session is aimed at A Level students in Year 12/13. The event discusses the Dijkstra’s and A* algorithms. The aim of the session is for you to be able to trace through a working example of both algorithms.
By attending this event, you will:
- Understand how the Dijkstra and A* pathfinding algorithms work, including the use of heuristics
- Use Dijkstra and A* on a given graph to find the shortest path
- Understand the benefits and drawbacks of A* over Dijkstra
These materials are shared only with Isaac Computer Science Booster participants in accordance with the Isaac Computer Science Terms of Use policy here: https://isaaccomputerscience.org/terms?examBoard=all&stage=all
Show health and safety information
Please be aware that resources have been published on the website in the form that they were originally supplied. This means that procedures reflect general practice and standards applicable at the time resources were produced and cannot be assumed to be acceptable today. Website users are fully responsible for ensuring that any activity, including practical work, which they carry out is in accordance with current regulations related to health and safety and that an appropriate risk assessment has been carried out.
Downloads
-
Isaac Pathfinding Handout 1.docx 118.12 KB
Show downloads
-
Isaac Pathfinding Handout 1.docx 118.12 KB
Information on the permitted use of this resource is covered by the Category Three Content section in STEM Learning’s Terms and conditions.
