The queens program solves the n-queens problem (where, in this
program, N is between 5 and 10 queens) using a straightforward
backtracking algorithm. The problem is: how may one place N queens
on an NxN chessboard such that no queen can attack a sister?
OPTIONS
queens
accepts the following options:
-window
Draw on a newly-created window. This is the default.
-root
Draw on the root window.
-install
Install a private colormap for the window.
-visual visual
Specify which visual to use. Legal values are the name of a visual class,
or the id number (decimal or hex) of a specific visual.
-wireframe
Render in wireframe instead of solid.
-fps
Display a running tally of how many frames per second are being rendered.
In conjunction with -delay 0, this can be a useful benchmark of
your GL performance.
ENVIRONMENT
DISPLAY
to get the default host and display number.
XENVIRONMENT
to get the name of a resource file that overrides the global resources
stored in the RESOURCE_MANAGER property.
BUGS
It's not unknown for this and other OpenGL hacks to fail under hardware accelaration (UtahGLX) and take the X server with them. Texture images must be 16x16 or 32x32 or 64x64 etc.
