0
0
Unityframework~5 mins

Pathfinding basics in Unity - Cheat Sheet & Quick Revision

Choose your learning style9 modes available
Recall & Review
beginner
What is pathfinding in game development?
Pathfinding is the process of finding a route from one point to another, usually for characters or objects to move around obstacles in a game world.
Click to reveal answer
beginner
Name a common algorithm used for pathfinding.
A common algorithm is A* (A-star), which finds the shortest path efficiently by combining the cost to reach a node and an estimate to the goal.
Click to reveal answer
beginner
What is a 'node' in pathfinding?
A node is a point or position in the game world that the pathfinding algorithm considers when finding a path. Nodes are connected to neighbors to form a graph.
Click to reveal answer
intermediate
Why do we use heuristics in pathfinding algorithms like A*?
Heuristics estimate the distance from a node to the goal, helping the algorithm prioritize which paths to explore first and find the shortest path faster.
Click to reveal answer
intermediate
What is the difference between grid-based and navmesh pathfinding?
Grid-based pathfinding uses a grid of squares or cells to find paths, while navmesh uses a mesh of polygons that better represent walkable areas, allowing smoother movement.
Click to reveal answer
Which algorithm is commonly used for finding the shortest path in games?
ABinary Search
BBubble Sort
CA* (A-star)
DDepth First Search
In pathfinding, what does a 'node' represent?
AA type of enemy
BA character's health
CA sound effect
DA point or position in the game world
What is the purpose of a heuristic in A* pathfinding?
ATo estimate distance to the goal
BTo increase the path length
CTo slow down the algorithm
DTo create obstacles
Which pathfinding method uses polygons to represent walkable areas?
AGrid-based
BNavmesh
CBinary Tree
DLinked List
What does pathfinding help a game character do?
AMove around obstacles to reach a target
BChange its color
CPlay background music
DSave game progress
Explain how the A* algorithm finds a path from start to goal.
Think about how A* uses both the distance traveled and an estimate to the goal.
You got /5 concepts.
    Describe the difference between grid-based and navmesh pathfinding and when you might use each.
    Consider how the shape of the walkable area affects character movement.
    You got /5 concepts.