Mazes
From Maze
(Difference between revisions)
(→Mazes in Mathematics) | (→Mazes in Mathematics) | ||
| Line 238: | Line 238: | ||
Of course, the celebrity of 10 Print... grows out of the quest for optimization, where the clever distillation of a solution to one line becomes the sign of mastery. The mathematical grand challenge of finding the shortest path thus introduces the aesthetic of optimization into the lore of mazes. Mazes become the basic structure of the challenges to modern computing, business, and civic life. 10 PRINT... in this light pays tribute to a most fundamental structure of contemporary life and the obstacle to commercial profits, traffic flows, and the coursing of information over networks. The maze and the network prove themselves to be cousins when treated by the Thesei of mathematics. 10 PRINT... is a thread, the clue, that leads gradually (and infinitely) toward goal of optimizing processes in the source code that will shape and control so much of civic life. | Of course, the celebrity of 10 Print... grows out of the quest for optimization, where the clever distillation of a solution to one line becomes the sign of mastery. The mathematical grand challenge of finding the shortest path thus introduces the aesthetic of optimization into the lore of mazes. Mazes become the basic structure of the challenges to modern computing, business, and civic life. 10 PRINT... in this light pays tribute to a most fundamental structure of contemporary life and the obstacle to commercial profits, traffic flows, and the coursing of information over networks. The maze and the network prove themselves to be cousins when treated by the Thesei of mathematics. 10 PRINT... is a thread, the clue, that leads gradually (and infinitely) toward goal of optimizing processes in the source code that will shape and control so much of civic life. | ||
| − | 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 | ||
| − | |||
| − | |||
| − | |||
| − | Dantzig, George B. “On the Shortest Route Through a Network.” Management Science 6.2 (1960): 187-190. Print. | ||
---- | ---- | ||
