1. In computer science, A* (pronounced "A star") is a computer algorithm that is widely used in pathfinding and ______________________

2. A* was created as part of the Shakey project, which had the aim of building a ___________________ that could plan its own actions

3. The A* search algorithm enjoys widespread use and popularity due to its performance and accuracy.

4. Which of the following statements is more likely to be accurate?

5. A* is an ________________________, meaning that it is formulated in terms of weighted graphs: starting from a specific starting node of a graph, it aims to find a path to the given goal node having the smallest cost

6. At each iteration of its main loop, A* needs to determine ___________________________

7. Specifically, A* selects the path that minimizes the following equation, where n is the next node on the path, g(n) is the cost of the path from the start node to n, and h(n) is _________________

8. Suppose we were trying to get from the bottom highlighted node to the node highlighted at the top. Why would we be likely to go to the node that has a heuristic of 10 first?

9. A* terminates when the path it chooses to extend is a path from start to goal or if _______________________________

10. Typical implementations of A* use a _______________________ to perform the repeated selection of minimum (estimated) cost nodes to expand

11. At each step of the algorithm, the node with the ______ f(x) value is removed from the queue, the f and g values of its neighbors are updated accordingly, and these neighbors are added to the queue

12. The algorithm continues until a goal node has a lower f value than any node in the queue (or _______________________).

13. Like breadth-first search, A* is considered 'complete' and will always find a solution if one exists provided

14. Dijkstra's algorithm is similar to the A* algorithm in that it makes guesses (uses heurisitcs) as to which is the best path to the target

15. Which of the following statements is more likely to be accurate?

16. Calulating the horizontal and vertical distance of each of the starting node's neighbour from the final node is sometimes called the _____________________

17. Another heurisitic might be to _____________________________, this is sometimes called the Euclidean heuristic

18. Which of the following statements is more likely to be accurate?

19. The total cost of getting from the present node to the target is _______________________ where g is the same one as the Dijkstra algorithm

20. In the following pseudocode, if line is TRUE, it suggests that: