Mazes
From Maze
(Difference between revisions)
(→Mazes in Mathematics) | (→Mazes in Mathematics) | ||
| Line 274: | Line 274: | ||
===Mazes in Mathematics=== | ===Mazes in Mathematics=== | ||
| − | The problem of solvability in mazes has become part of the purview of mathematics, particularly in the area of "critical path analysis" (CPA). | + | The problem of solvability in mazes has become part of the purview of mathematics, particularly in the area of "critical path analysis" (CPA). Critically CPA has its origins not in hedgerows or darkened hallways but the twisty little corridors of project management. |
| − | Critical Path Analysis, developed by Dupont in the late 1950s for project management, became an algorithmic approach to the shortest path problem. This puzzle appears in telephone routing, planning routes for driving, and optimizing circuit boards. | + | Critical Path Analysis, developed by James E. Kelley and Morgan Walker at Dupont in the late 1950s, became an algorithmic approach to the shortest path problem. This puzzle appears in telephone routing, planning routes for driving, and optimizing circuit boards. |
"The first autorouter was tested on a map of the maze at Hampton Court Palace about 35 years ago." | "The first autorouter was tested on a map of the maze at Hampton Court Palace about 35 years ago." | ||
An interesting reversal happens. As maze-solving algorithms are applied to more and more real world puzzles, they in turn prove themselves to be mazes of telephones, rest stops, and resisters. | An interesting reversal happens. As maze-solving algorithms are applied to more and more real world puzzles, they in turn prove themselves to be mazes of telephones, rest stops, and resisters. | ||
| + | |||
| + | James E. Kelley, J., & Walker, M. R. (1959). Critical-path planning and scheduling. In Papers presented at the December 1-3, 1959, eastern joint IRE-AIEE-ACM computer conference (pp. 160-173). Boston, Massachusetts: ACM. doi:10.1145/1460299.1460318 | ||
---- | ---- | ||
