Pathfinding is a broad category of computational problems, aimed at finding a path (usually optimised to be the shortest path) between two points. An applied case of this is maze-solving.
Pathfinding is a broad category of computational problems, aimed at finding a path (usually optimised to be the shortest path) between two points. An applied case of this is maze-solving.