SLR26: A* Pathfinding

What is the A-Star Pathfinding Algorithm primarily used for?

• Simulating weather patterns

• Finding the shortest path in a weighted graph using heuristics

• Encrypting data for secure communication

• Sorting numbers in ascending order

What is the main advantage of the A-Star algorithm over Dijkstra's algorithm?

• It is faster for sorting operations

• It considers every vertex in the graph

• It uses heuristics to find the most optimal path

• It requires less memory

What is the term used for the vertices being considered in the A-Star algorithm?

• The List

• The Fringe

• The Stack

• The Queue

In the context of A-Star, what is a heuristic?

• A measure of time complexity

• The exact distance to the goal

• An estimate of the remaining distance to the goal

• A random number

What is an admissible heuristic?

• A heuristic that provides a sensible estimate

• A heuristic that overestimates the cost

• A heuristic that is randomly generated

• A heuristic that underestimates the cost

Which approach is known as the Manhattan approach?

• Using the shortest path algorithm

• Using random numbers for distance

• Using a grid-based distance calculation

• Using the Euclidean distance

What is the F value in the A-Star algorithm?

• The quotient of G and H values

• The difference between G and H values

• The product of G and H values

• The sum of G and H values

What is the G value in the A-Star algorithm?

• The heuristic estimate

• The distance from the start vertex

• The total path cost

• The number of vertices visited

In which scenario does the Manhattan approach not make sense?

• When the graph is weighted

• When the graph is undirected

• When there are portals or hazards

• When the graph is a simple grid

What is the primary application of the A-Star algorithm in video games?

• Generating random levels

• Rendering graphics

• Simulating physics

• Moving non-playable characters intelligently