159. OCR A Level (H446) SLR26 – 2.3 A star pathfinding revisited

About this video

OCR Specification Reference
A Level 2.3.1f

This video takes another look at the A* pathfinding algorithm and provides extra clarification regarding its ability to find the shortest route between two nodes of a weighted graph.

Key question:

- Under what circumstances does the A* pathfinding algorithm terminate?

00:00 A* pathfinding revisited
00:08 Intro
00:13 A note about this video
00:27 A* pathfinding algorithm
06:31 Key question
06:43 Going beyond the specification
06:56 Grid-based maps, graphs and pathfinding optimisation
10:41 Essential algorithms for A Level Computer Science text book
11:46 Outro

Last updated: 28.07.26

Other videos on this course