Fast Pathfinding via Symmetry Breaking
| Date written: | Feb, 2012 |
| Authors: | Daniel Harabor |
| Resource type: | article |
| Links: | [html] |
Description
Very effective, yet simple, algorithm to reduce the amount of work performed by A* algorithms for path finding.
DB information
| Date created: | 2012-04-27 15:36:26 |
| Date evaluated: | 2012-04-27 15:36:26 |
| Categories: | Artificial Intelligence/Path finding/A* and its derivatives |