Please enable JavaScript.
Coggle requires JavaScript to display documents.
Pathfinding Algorithms, image - Coggle Diagram
Pathfinding Algorithms
Introduction
-
A Pathfinding Algorithm is a method used to find the best path (usually the shortest or most efficient one) between two points in a graph or map.
-
-
Dijkstra’s Algorithm
-
How it works
Applies Edge relaxation (If a shorter path to a neighbor is found, update it)
-
-
Based on Breadth-First Search (BFS), but enhanced
-
Example Flow
-
New list after visiting neighbors: { B(2), D(3), C(4) }
-
Check B → path to D is redundant → { E(4), D(3), C(4) }
-
Check E → find F at cost 10 → { C(4), F(10) }
-
Check D → find better path to E → { E(3), C(4) }
-
-
Pathfinding in Games
Importance
-
Makes game worlds feel more intelligent, challenging, and alive.
Common Techniques
Grid-Based Pathfinding: The game world is divided into a grid, and characters move from one square to another.
-
Dynamic Environments: Pathfinding must adapt to moving objects, new obstacles, or changing terrain in real time.
-
Slime Mould Pathfinding
What is it?
A brainless, single-celled organism
-
Then retracts, leaving behind the most efficient paths
-
-
