Mazes
From Maze
(Difference between revisions)
(→Mazes in Mathematics) | |||
| Line 490: | Line 490: | ||
[[Image:10print-77,78-NM-letters.png|left|thumb|160px|10 PRINT CHR$(77+RND(1)*2); : GOTO 10]] | [[Image:10print-77,78-NM-letters.png|left|thumb|160px|10 PRINT CHR$(77+RND(1)*2); : GOTO 10]] | ||
| + | ---- | ||
| + | == Bibliography == | ||
| − | == Bibliography == | + | 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. | ||
''Commodore 64 User's Guide''. Wayne PA; Indianapolis, IN: Commodore Business Machines; Distributed by Howard W. Sams & Co., 1982. <http://www.commodore.ca/manuals/c64_users_guide/c64-users_guide.htm>. | ''Commodore 64 User's Guide''. Wayne PA; Indianapolis, IN: Commodore Business Machines; Distributed by Howard W. Sams & Co., 1982. <http://www.commodore.ca/manuals/c64_users_guide/c64-users_guide.htm>. | ||
