thumb|upright=1.2|Equivalent paths between A and B in a 2D environment
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.
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).