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 geometry or graphs 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 maze.
|
created |
12 years, 7 months ago by C. K. Young |
|
viewed |
65 times |
|
active |
8 years, 6 months ago |
|
editors |
2 |
