Please enable JavaScript.
Coggle requires JavaScript to display documents.
Pathfinding Algorithms - Coggle Diagram
Pathfinding Algorithms
Fundamentals
-
Search Tree: Represents the exploration of the state space, with nodes representing states and branches representing actions
-
-
-
-
Heuristics
-
Two heuristics: number of misplaced tiles (h1) and Manhattan distance (h2)
H2 dominates h1 (more accurate)
Types of Heuristics: Manhattan, Diagonal, Euclidean
-
Slime Mold
Biological Inspiration
-
Can solve complex problems, such as finding optimal networks
-
-
Links
-
-
-
-
-
-
-
Shows comparisons between A*, Dijkstra and concurrent D:
-