   Q U E E N S     -  Platform: VM/CMS


   This program is a resolution of the eight chess queens problem,
that is, in a chessboard you must put 8 queens in a way that every
queen cannot hit any other queen.


   In this distribution file (CMSQUEEN.ZIP) there is:

QUEENS.TEXT              executable for VM/CMS mainframe, in obj form
QUEENS.HIL               Hilmas source of this file
README.TXT               this help file 

   Note: OBJ is the Italian version of the program, source is in English.


OBJ installation:

- SEND obj module from PC to your CMS machine in BINARY form, with your
  3270 emulation; the most important thing is a binary transfer (therefore 
  without ASCII CRLF)
  Use this PC command (in a PC with IBM/PCOMM 4.1 3270 emulation installed):

     SEND QUEENS.TEXT QUEENS TEXT A  (RECFM F LRECL 80

- Use these CMS commands to generate the executable (MODULE) file:
     LOAD  QUEENS 
     GENMOD QUEENS
  and now in your minidisk A you have the file QUEENS MODULE A
  Run this program with
     QUEENS
  entered at CMS prompt.


Program instruction:

   This program is a generalization of the classic problem: you can
have a solution for every chessboard size from 4 to 12; and at the same
time this programming problem is a classical example of recursivity.
We thanks to Niklaus Wirth for the algorithm.

   The program starts and ask you the size of the chessboard; then,
for every output line a solution is showed: the first number is the row
where to put a queen in the first column; the second number is the row 
where to put the second queen in the second column, and so on.


