{"id":1325,"date":"2021-01-05T14:42:53","date_gmt":"2021-01-05T14:42:53","guid":{"rendered":"http:\/\/learnlearn.uk\/alevelcs\/?page_id=1325"},"modified":"2021-02-01T23:31:49","modified_gmt":"2021-02-01T23:31:49","slug":"a-star-algorithm","status":"publish","type":"page","link":"https:\/\/learnlearn.uk\/alevelcs\/a-star-algorithm\/","title":{"rendered":"A* Algorithm"},"content":{"rendered":"
\n

Introduction<\/h2>\n
\n\n

A* Algorithm Introduction<\/h3>\n

One of the biggest problems with Dijkstra’s algorithm is that it is that it has the potential to be inefficient when searching for the shortest path, because it just looks for the next shortest leg<\/p>\n

Heuristic<\/p>\n

Combined weighting (Heuristic\u00a0 + cost)<\/p>\n\n<\/div>

Heuristic<\/h2>\n
\n\n

Heuristics<\/p>\n

There are a number of common heuristic methods that can be used when<\/p>\n

Manhattan Method<\/p>\n

Diagonal Distance<\/p>\n

Euclidean Distance<\/p>\n

 <\/p>\n\n<\/div>

Video<\/h2>\n
\n\n
\n
https:\/\/youtu.be\/ySN5Wnu88nE<\/a>