Skip to main content

Problems in geometry or graph theory that involve finding an optimal (e.g. shortest) path, subject to constraints (obstacles).

Path-finding is a problem in or that involves finding an optimal path subject to specified constraints. Path-finding can be used for e.g. AI players in a computer game.

Example of a path-finding problem: finding the shortest path through a .