1 .TH XScreenSaver 1 "7-mar-93" "X Version 11"
3 maze \- an automated X11 demo repeatedly creating and solving a random maze
6 [\-display \fIhost:display.screen\fP] [\-foreground \fIcolor\fP] [\-background \fIcolor\fP] [\-window] [\-root] [\-install] [\-visual \fIvisual\fP] [\-grid\-size \fIpixels\fP] [\-live\-color \fIcolor\fP] [\-dead\-color \fIcolor\fP] [\-solve\-delay \fIusecs\fP] [\-pre\-delay \fIusecs\fP] [\-post\-delay \fIusecs\fP] [\-generator \fIinteger\fP] [\-max\-length \fIinteger\fP]
9 The \fImaze\fP program creates a "random" maze and then solves it with
13 accepts the following options:
16 Draw on a newly-created window. This is the default.
19 Draw on the root window.
22 Install a private colormap for the window.
24 .B \-visual \fIvisual\fP
25 Specify which visual to use. Legal values are the name of a visual class,
26 or the id number (decimal or hex) of a specific visual.
28 .B \-grid\-size \fIpixels\fP
29 The size of each block of the maze, in pixels; default is 0, meaning
30 pick a random grid size. Minimum meaningful value is 2.
32 .B \-live\-color \fIcolor\fP
33 The color of the path.
35 .B \-dead\-color \fIcolor\fP
36 The color of the failed path (it is also stippled with a 50% pattern.)
38 .B \-skip\-color \fIcolor\fP
39 The maze solver will choose to not go down a path if it can "see" (in a
40 straight line) that it is a dead end. This is the color to use for paths
41 that are skipped for this reason.
43 .B \-surround\-color \fIcolor\fP
44 If the maze solver ever completely encloses an area within the maze, then
45 it knows that the exit is not in there (and in fact the interior of that
46 area might not even be reachable.) It will mark out those cells using this
49 .B \-solve\-delay \fIinteger\fP
50 Delay (in microseconds) between each step of the solution path.
51 Default 5000, or about 1/200th second.
53 .B \-pre\-delay \fIinteger\fP
54 Delay (in microseconds) between generating a maze and starting to solve it.
55 Default 2000000 (2 seconds.)
57 .B \-post\-delay \fIinteger\fP
58 Delay (in microseconds) after solving a maze and before generating a new one.
59 Default 4000000 (4 seconds.)
61 .B \-generator \fInum\fP
62 Sets the algorithm that will be used to generate the mazes. The
63 default is \-1, which randomly selects an algorithm for each maze that
64 is generated. Generator 0 is the original one, and works by walking
65 around randomly until we hit a place we've been before, then
66 backtracking and trying a new direction somewhere. Generator 1 picks a
67 random spot in the maze, then draws a straight wall from that spot in
68 a random direction until it hits another wall (and continues until the
69 maze is complete). Generator 2 is based on sets. Initially all cells
70 are in different sets. Then two neighboring cells are chosen and if
71 they are in different sets, their sets are joined. If they were in the
72 same set, a wall is built between them. This continues until the maze is
75 All generators generate mazes with a certain 'characteristic'. See if you
78 The three algorithms are essentially Kruskal, Prim, and a depth-first
79 recursive backtracker.
81 .B \-max\-length \fInum\fP
82 Controls the maximum length of walls drawn in one go by generator 1.
84 Clicking the mouse in the maze window controls it.
87 Clears the window and restarts maze.
90 Pause or unpause the program.
96 Display the current frame rate and CPU load.
98 Expose events force a restart of maze.
100 Mouse actions are based on "raw" values (Button1, Button2 and Button3)
101 instead of using the pointer map.
106 to get the default host and display number.
109 to get the name of a resource file that overrides the global resources
110 stored in the RESOURCE_MANAGER property.
116 Copyright \(co 1988 by Sun Microsystems, Inc. Mountain View, CA.
120 Permission to use, copy, modify, and distribute this software and its
121 documentation for any purpose and without fee is hereby granted, provided that
122 the above copyright notice appear in all copies and that both that copyright
123 notice and this permission notice appear in supporting documentation, and that
124 the names of Sun or MIT not be used in advertising or publicity pertaining to
125 distribution of the software without specific prior written permission. Sun
126 and M.I.T. make no representations about the suitability of this software for
127 any purpose. It is provided "as is" without any express or implied warranty.
129 SUN DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING ALL
130 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. IN
131 NO EVENT SHALL SUN BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL
132 DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
133 WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING
134 OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
137 Zack Weinberg [ Smarter maze-solver ] zack@rabi.phys.columbia.edu
138 Johannes Keukelaar [ Generators 1 and 2 ] johannes@nada.kth.se
139 Royal Institute of Technology, Stockholm, Sweden
140 Jim Randell [ XScreenSaver version ] jmr@mddjmr.fc.hp.com
142 Richard Hess [ X11 extensions ] {...}!uunet!cimshop!rhess
143 Consilium, Mountain View, CA
144 Dave Lemke [ X11 version ] lemke@sun.COM
145 Sun MicroSystems, Mountain View, CA
146 Martin Weiss [ SunView version ]
147 Sun MicroSystems, Mountain View, CA
projects / xscreensaver / blob