Isaac Computer Science: Pathfinding algorithms - A level student booster

This online A level booster session from Isaac Computer Science covers pathfinding algorithms with a focus on Dijkstra's algorithm and A*. The session explains the underlying concepts, the use of heuristics in A*, and walks through working examples so attendees can trace each algorithm on a graph.

The session is hosted live and will not be recorded. The event is aimed at A level students (Year 12 and 13) who want to revise or gain confidence in these topics. By the end of the session participants should be able to use Dijkstra and A* to find shortest paths, understand the trade-offs between the algorithms, and appreciate how heuristics affect A*'s performance.

Basic prior knowledge is expected: familiarity with lists and two-dimensional arrays, programming constructs (sequences, selection, iteration), and subroutines. Teachers may reserve up to 30 student places; students who are reserved must confirm their reservation within 72 hours to secure their spot and receive event materials.