Mazes
From Maze
(Difference between revisions)
(→Bibliography) | (→Computer Generated Mazes) | ||
| Line 169: | Line 169: | ||
Clifford Pickover wries of "the largest computer-generated maze in the world," a designation which seems quaint today. Although he notes the program could generate an 1000-page maze, he cites the largest one she had printed to date as a 200-page maze. However, he gives the title to the 1987 maze produced by Walter Pullen. This 23-foot maze had to be stored on "eight floppy disks" and "require one megabyte of disk space" (7). In a note, Pickover mentions a maze Pullen had generated with "@2 miles of passages" that "stretched over 3031 pages" (8). | Clifford Pickover wries of "the largest computer-generated maze in the world," a designation which seems quaint today. Although he notes the program could generate an 1000-page maze, he cites the largest one she had printed to date as a 200-page maze. However, he gives the title to the 1987 maze produced by Walter Pullen. This 23-foot maze had to be stored on "eight floppy disks" and "require one megabyte of disk space" (7). In a note, Pickover mentions a maze Pullen had generated with "@2 miles of passages" that "stretched over 3031 pages" (8). | ||
| − | Some formulation of Moore's Law, which in its first formulation describes how the number of transistors on a chip doubes every 18 months, could surely apply to describe the continual increase in the area of single-solution computer-generated mazes. In the more general space of convoluted structures, solvable or not, the quest for the largest computer-generated maze will always be chasing 10 PRINT, whose never-ending corridors can be drawn with a one-line ''reductio ad absurdum.'' | + | Some new formulation of Moore's Law, which originally described how the number of transistors on a chip doubles every 18 months, could surely apply to describe the continual increase in the area of single-solution computer-generated mazes. In the more general space of convoluted structures, solvable or not, the quest for the largest computer-generated maze will always be chasing 10 PRINT, whose never-ending corridors can be drawn with a one-line ''reductio ad absurdum.'' |
=== Context of Expectations: Computer Graphics and Games === | === Context of Expectations: Computer Graphics and Games === | ||
