Pathfinding generally refers to the plotting, by a computer application, of the shortest route between two points. It is a more practical variant on solving mazes.
Beginners Guide to Pathfinding Algorithms
Blind Search
Assume you know nothing about the graph/tree/network/whatever being searched (I'm just going to call it a tree from now on because, ...
Pathfinding is often associated with AI, because the A* algorithm and many other pathfinding algorithms were developed by AI researchers. Several biology-inspired AI techniques are currently popular, and I receive questions about why I don't use them.
Several approaches were used to aid their understanding, by far the most effective of which was providing students with full source code for four bugs (including one very highly functional bug with mapping and pathfinding capabilities).
Examples of best-first search algorithms include Dijkstra's algorithm and the A-star search algorithm. Best-first algorithms are often used for pathfinding in combinatorial search.
See also ...
 See also: AI, Planning, Artificial intelligence, Depth-first search, Search algorithm
  
|
RSS
