Pathfinding on 2D grid Problem
Pathfinding is generally the process of finding a route between two points. It is closely related to the shortest path problem in graph theory, which examines how to identify the "best" paths valued by different criteria (Ex. distance, cost, time consumption).
Pathfinding is also similar to Searching in some circumstances. For instance, we can use [breadth-first search] to find the shortest path in a grid world.