X-Git-Url: http://git.hungrycats.org/cgi-bin/gitweb.cgi?a=blobdiff_plain;f=local%2Fman%2Fman.1%2Fmaze.1;h=f48265059ead8f18bf1beba750ae3698c582042a;hb=41fae2ad67bc37e31c4d967bae81e4f3f50fa55a;hp=f93a70f49eb808a0f3af698d5e773c6c35f9f5d5;hpb=3ee611d60b5c560208c27e83b0c4930596fddd8b;p=xscreensaver diff --git a/local/man/man.1/maze.1 b/local/man/man.1/maze.1 index f93a70f4..f4826505 100644 --- a/local/man/man.1/maze.1 +++ b/local/man/man.1/maze.1 @@ -3,7 +3,7 @@ maze \- an automated X11 demo repeatedly creating and solving a random maze .SH SYNOPSIS .B maze -[\-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] +[\-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] [\-bridge] [\-no\-bridge] .SH DESCRIPTION The \fImaze\fP program creates a "random" maze and then solves it with graphical feedback. @@ -34,6 +34,17 @@ The color of the path. .B \-dead\-color \fIcolor\fP The color of the failed path (it is also stippled with a 50% pattern.) .TP 8 +.B \-skip\-color \fIcolor\fP +The maze solver will choose to not go down a path if it can "see" (in a +straight line) that it is a dead end. This is the color to use for paths +that are skipped for this reason. +.TP 8 +.B \-surround\-color \fIcolor\fP +If the maze solver ever completely encloses an area within the maze, then +it knows that the exit is not in there (and in fact the interior of that +area might not even be reachable.) It will mark out those cells using this +color. +.TP 8 .B \-solve\-delay \fIinteger\fP Delay (in microseconds) between each step of the solution path. Default 5000, or about 1/200th second. @@ -45,6 +56,31 @@ Default 2000000 (2 seconds.) .B \-post\-delay \fIinteger\fP Delay (in microseconds) after solving a maze and before generating a new one. Default 4000000 (4 seconds.) +.TP 8 +.B \-generator \fInum\fP +Sets the algorithm that will be used to generate the mazes. The +default is \-1, which randomly selects an algorithm for each maze that +is generated. Generator 0 is the original one, and works by walking +around randomly until we hit a place we've been before, then +backtracking and trying a new direction somewhere. Generator 1 picks a +random spot in the maze, then draws a straight wall from that spot in +a random direction until it hits another wall (and continues until the +maze is complete). Generator 2 is based on sets. Initially all cells +are in different sets. Then two neighboring cells are chosen and if +they are in different sets, their sets are joined. If they were in the +same set, a wall is built between them. This continues until the maze is +complete. + +All generators generate mazes with a certain 'characteristic'. See if you +can spot them! +.TP 8 +.B \-max\-length \fInum\fP +Controls the maximum length of walls drawn in one go by generator 1. +.TP 8 +.B \-bridge +.TP 8 +.B \-no\-bridge +Controls whether or not a 'bridge' will appear over the logo. .PP Clicking the mouse in the maze window controls it. .TP 16 @@ -96,6 +132,9 @@ WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. .SH AUTHOR(s) .nf +Zack Weinberg [ Smarter maze-solver ] zack@rabi.phys.columbia.edu +Johannes Keukelaar [ Generators 1 and 2 ] johannes@nada.kth.se + Royal Institute of Technology, Stockholm, Sweden Jim Randell [ XScreenSaver version ] jmr@mddjmr.fc.hp.com HPLabs, Bristol Richard Hess [ X11 extensions ] {...}!uunet!cimshop!rhess