1maze(6x) XScreenSaver manual maze(6x)
2
6 maze - an automated X11 demo repeatedly creating and solving a random
7 maze
8
10 maze [-display host:display.screen] [-foreground color] [-background
11 color] [-window] [-root] [-install] [-visual visual] [-grid-size pix‐
12 els] [-live-color color] [-dead-color color] [-solve-delay usecs]
13 [-pre-delay usecs] [-post-delay usecs] [-generator integer]
14 [-max-length integer] [-fps]
15
17 The maze program creates a "random" maze and then solves it with graph‐
18 ical feedback.
19
21 maze accepts the following options:
22 -window Draw on a newly-created window. This is the default.
24 -root Draw on the root window.
26 -install
28 Install a private colormap for the window.
29 -visual visual
31 Specify which visual to use. Legal values are the name of a
32 visual class, or the id number (decimal or hex) of a specific
33 visual.
34 -grid-size pixels
36 The size of each block of the maze, in pixels; default is 0,
37 meaning pick a random grid size. Minimum meaningful value is
38 2.
39 -live-color color
41 The color of the path.
42 -dead-color color
44 The color of the failed path (it is also stippled with a 50%
45 pattern.)
46 -skip-color color
48 The maze solver will choose to not go down a path if it can
49 "see" (in a straight line) that it is a dead end. This is the
50 color to use for paths that are skipped for this reason.
51 -surround-color color
53 If the maze solver ever completely encloses an area within the
54 maze, then it knows that the exit is not in there (and in fact
55 the interior of that area might not even be reachable.) It
56 will mark out those cells using this color.
57 -solve-delay integer
59 Delay (in microseconds) between each step of the solution path.
60 Default 5000, or about 1/200th second.
61 -pre-delay integer
63 Delay (in microseconds) between generating a maze and starting
64 to solve it. Default 2000000 (2 seconds.)
65 -post-delay integer
67 Delay (in microseconds) after solving a maze and before gener‐
68 ating a new one. Default 4000000 (4 seconds.)
69 -generator num
71 Sets the algorithm that will be used to generate the mazes. The
72 default is -1, which randomly selects an algorithm for each
73 maze that is generated. Generator 0 is the original one, and
74 works by walking around randomly until we hit a place we've
75 been before, then backtracking and trying a new direction some‐
76 where. Generator 1 picks a random spot in the maze, then draws
77 a straight wall from that spot in a random direction until it
78 hits another wall (and continues until the maze is complete).
79 Generator 2 is based on sets. Initially all cells are in dif‐
80 ferent sets. Then two neighboring cells are chosen and if they
81 are in different sets, their sets are joined. If they were in
82 the same set, a wall is built between them. This continues
83 until the maze is complete.
84 All generators generate mazes with a certain 'characteristic'.
86 See if you can spot them!
87 The three algorithms are essentially Kruskal, Prim, and a
89 depth-first recursive backtracker.
90 -max-length num
92 Controls the maximum length of walls drawn in one go by genera‐
93 tor 1.
94 Clicking the mouse in the maze window controls it.
96 LeftButton Clears the window and restarts maze.
98 MiddleButton Pause or unpause the program.
100 RightButton Exit.
102 -fps Display the current frame rate and CPU load.
104
106 Expose events force a restart of maze.
107 Mouse actions are based on "raw" values (Button1, Button2 and Button3)
109 instead of using the pointer map.
110
112 DISPLAY to get the default host and display number.
113 XENVIRONMENT
115 to get the name of a resource file that overrides the global
116 resources stored in the RESOURCE_MANAGER property.
117
119 X(1), xscreensaver(1)
120
122 Copyright © 1988 by Sun Microsystems, Inc. Mountain View, CA.
123 All Rights Reserved
125 Permission to use, copy, modify, and distribute this software and its
127 documentation for any purpose and without fee is hereby granted, pro‐
128 vided that the above copyright notice appear in all copies and that
129 both that copyright notice and this permission notice appear in sup‐
130 porting documentation, and that the names of Sun or MIT not be used in
131 advertising or publicity pertaining to distribution of the software
132 without specific prior written permission. Sun and M.I.T. make no rep‐
133 resentations about the suitability of this software for any purpose. It
134 is provided "as is" without any express or implied warranty.
135 SUN DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING
137 ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
138 PURPOSE. IN NO EVENT SHALL SUN BE LIABLE FOR ANY SPECIAL, INDIRECT OR
139 CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
140 USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
141 OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
142 PERFORMANCE OF THIS SOFTWARE.
143
145 Zack Weinberg [ Smarter maze-solver ] zack@rabi.phys.columbia.edu
146 Johannes Keukelaar [ Generators 1 and 2 ] johannes@nada.kth.se
147 Royal Institute of Technology, Stockholm, Sweden
148 Jim Randell [ XScreenSaver version ] jmr@mddjmr.fc.hp.com
149 HPLabs, Bristol
150 Richard Hess [ X11 extensions ] {...}!uunet!cimshop!rhess
151 Consilium, Mountain View, CA
152 Dave Lemke [ X11 version ] lemke@sun.COM
153 Sun MicroSystems, Mountain View, CA
154 Martin Weiss [ SunView version ]
155 Sun MicroSystems, Mountain View, CA
156X Version 11 5.43-2.fc31 (27-Aug-2019) maze(6x)