pathfinding
Sign in to saveAlso known as pathing, path-finding, routing
thumb|upright=1.2|Equivalent paths between A and B in a 2D environment
Wikidata facts
Show 2 more facts
- Stack Exchange tag
- stackoverflow.com/tags/path-finding
- Commons category
- Pathfinding
Sources (3)
via Wikidata · CC0
~11 min read
Article
11 sectionsContents
- Algorithms
- Dijkstra's algorithm
- A* algorithm
- In video games
- Hierarchical path finding
- Example
- Algorithms used in pathfinding
- Multi-agent pathfinding
- See also
- References
- External links
thumb|upright=1.2|Equivalent paths between A and B in a 2D environment
Pathfinding or pathing is the search, by a computer application, for the shortest route between two points. It is a more practical variant on solving mazes. This field of research is based heavily on Dijkstra's algorithm for finding the shortest path on a weighted graph.
Gallery (2)
Connections
Bellman–Ford algorithm
Entity
glossary of graph theory terms
Entity
YouTube
Concept
International Standard Book Number
Entity
algorithm
Entity
Wayback Machine
Entity
digital object identifier
Entity
graph theory
Entity
Dijkstra's algorithm
Entity
dynamic programming
Entity
depth-first search
Entity
travelling salesperson problem
Entity
Euclidean distance
Entity
breadth-first search
Entity
intelligent agent
Entity
node
Entity
cellular automaton
Entity
Prim's algorithm
Entity
A* search algorithm
Entity
minimum spanning tree
Entity