ONE 6th FORM A*Search

What is the main difference between Dijkstra's algorithm and A* search?

• Dijkstra's algorithm is faster than A* search.
• A* search only works on unweighted graphs.
• Dijkstra's algorithm is uninformed and explores all paths, while A* uses heuristics to optimize the search towards the goal.
• Dijkstra's algorithm uses heuristics to find the shortest path.

What is a heuristic in the context of A* search?

• A heuristic is the exact cost to reach the goal from a node.
• A heuristic is a random guess about the goal.
• A heuristic is an estimate of the cost to reach the goal from a node.
• A heuristic is a method to find all possible paths in the search.

When does A* search behave exactly like Dijkstra's algorithm?

• When the heuristic function h(n) is zero for all nodes.
• When the algorithm is modified to use a random heuristic function.
• When the search space is fully connected with equal edge weights.
• When the heuristic function h(n) is equal to the actual cost for all nodes.

Which of the following is true about A* search?

• A* search is only optimal if the heuristic is consistent.
• A* search can be incomplete if the search space is infinite.
• A* search is optimal and complete when the heuristic is admissible.
• A* search is faster than Dijkstra's algorithm in all cases.

What does A* aim to minimize at each step of the algorithm?

• The distance from the start node to the current node.
• The heuristic estimate from the current node to the goal node.
• The total number of nodes expanded so far.
• The total estimated cost from the start node to the goal node.

What is the significance of a consistent heuristic in A* search?

• A consistent heuristic reduces the number of nodes expanded in A* search.
• A consistent heuristic guarantees optimality and efficiency in A* search.
• A consistent heuristic can lead to suboptimal solutions in A* search.
• A consistent heuristic is only necessary for graph search algorithms.

Define what is meant by the term 'algorithm'

• Step by step instructions or rules to solve a problem.
• Code for a specific task.

What is the primary purpose of a heuristic in search algorithms?

• To calculate the exact cost from the start node to the goal node

• To estimate the cost from the current node to the goal node

• To determine the shortest path from the start node to the goal node

• To increase the branching factor of the search

In the context of game development, why is pathfinding important?

• It helps in rendering graphics

• It determines the shortest path for characters to move

• It is used for sound effects

• It is used for network communication

Which of the following is a key difference between A* and Dijkstra's algorithm?

• A* uses a heuristic function, while Dijkstra's does not

• Dijkstra's algorithm is faster than A* in all cases

• A* can only be used on undirected graphs

• Dijkstra's algorithm requires a heuristic function