From the course: Python Data Structures and Algorithms

Challenge: Trace the path of an A* search - Python Tutorial

From the course: Python Data Structures and Algorithms

Start my 1-month free trial

Challenge: Trace the path of an A* search

“

(upbeat music) - Here's the challenge to practice your skill with the A* search algorithm. So using the A* search algorithm, which we have discussed, what is the path from zero, zero to three, three, as shown on this grid? So I recommend you use a pen and paper or a whiteboard or the grid tracer app. And with the grid tracer app, you can set the size to four in the JS file, and you can uncomment the lines that give you coordinates, that you want to work with exactly in the same diagram as this. Irregardless of which method you use, your task is to find the path from zero, zero to three, three, using the algorithm. And in order to do that you going to have to keep track of those various values so, your G values F values H values. This challenge should take approximately 12 to 15 minutes to complete.

Contents