When you implement A* search, remember the priority in the queue has to reflect both the path cost and the heuristic value for that state. One way you can get both of these in is to build them both into your lambda function that you create. If you do this, you should be able to get an algorithm that passes the autograder test if you (make sure you use the appropriate data structure in util.py).