|
NAMExlaby - X Labyrinth, the aMAZEmentSYNOPSISxlaby [ options ]DESCRIPTIONX Labyrinth is a labyrinth game under X11 that is played directly with the mouse pointer: the walls block the pointer's movement on the screen.The goal of the game is to retrieve the four colored squares: to retrieve a square, it is sufficient to move the pointer over it, and it will disappear. However, to make things more infuriating, the squares have to be taken in the following order: red, yellow, green and blue. When the blue square is obtained, the game is won. Unless otherwise specified (see OPTIONS below), it is possible to quit the game at any moment by pressing Q or escape and to suspend the game by pressing Z or tab (same key to resume). If the maze window is suddenly obscured or changes size or position, it is possible to restore it to the correct position, size and visibility by pressing the space bar. It is possible to chose between three types of maze building algorithms (see OPTIONS below): the "tree", "flood" and "chain" maze. Exit code is 1 in case of error, 42 if the maze was successfully solved, and 0 otherwise. This can be useful in shell scripts for example to test the user's patience. OPTIONS
Note that multiple options cannot be concatenated, so xlaby -pt
is not valid: use
xlaby -p -t
instead.
Also note that standard X toolkit options are not recognized, as the program uses low-level X. ENVIRONMENT
RESOURCESNone!BUGSOption syntax is very non-standard. Having to use the --play option is a pain.X resources are not recognized. The colors cannot be specified. Only the position of the window can be given, and it does not interact properly with the window manager (only I do not trust WMs). There are probably cases which I overlooked and in which the window is not fully visible. Unfortunately, as far as I know, the Xlib does not furnish any easy way of making absolutely sure a window is entirely visible. I guess it must look awful on a monochrome display. The tree maze is outrageously slow for large maze sizes. The game is about unplayable when run across a network as the mouse cursor may freeze for a long time on a cell boundary. There is no high score table. So the name of the first person who completes the size 9 chain maze in blind mode shall not go down in History (still, if you do, send me a mail). The blue square (randomly placed) may overlap another one. Actually, this is more a feature than a bug. There is no way to change the number, colors, or position of the squares. The man page does not describe all the bugs (otherwise this section would be the longest by far). AUTHORSPeter Horvai (peter.horvai@ens.fr) for the initial idea and chain maze algorithm.David Madore (david.madore@ens.fr) for most of the programming, the tree maze algorithm, and this man page. Special thanks to Mladen Dimitrov for the flood maze algorithm. COPYINGGNU public license. See the file COPYING for more information.SEE ALSOmaze(1)
Visit the GSP FreeBSD Man Page Interface. |