.SPACING 1
.PERIOD
.C
^^[ 3 0 0 , 3 0 1 ] M U L T I - T R E K\\
.C
---------------------------------------
.S
^^MULTI-TREK\\ IS A GAME SIMILAR TO TRADITIONAL ^STAR-TREK GAMES EXCEPT THAT
IT INVOLVES SEVERAL PLAYERS (CURRENTLY UP TO 8), WHO PLAY AGAINST EACH OTHER
RATHER THAN AGAINST IMAGINARY ^KLINGONS, ^ROMULANS OR WHATEVER. ^THE UNIVERSE
CONSISTS OF A 100 BY 100 MATRIX, OF WHICH A PLAYER CAN SEE AN APPROXIMATE
20 BY 20 MATRIX OF HIS/HER IMMEDIATE AREA.
.S
^THE GAME CONSISTS OF A REAL-TIME DRIVER TASK, A TIME-SHARED PLAYER TASK
FOR EACH TERMINAL AND A SHARED GLOBAL COMMON FOR INTER-TASK COMMUNICATION.
^^MULTI-TREK\\ WAS WRITTEN FOR ^^IAS\\ (CURRENTLY RUNNING UNDER VERSION 3.0),
HOWEVER, IT SHOULD RUN UNDER ANY SYSTEM WITH SHARED GLOBAL AND REAL-TIME
CAPABILITIES. ^REAL-TIME SYSTEMS WITHOUT TIME-SHARING MAY HAVE TO PLAY WITH
PRIORITIES TO INSURE THAT THE DRIVER TASK GETS SUFFICIENT ^^CPU\\ TIME AND
THAT ALL PLAYERS GET AN EQUAL AMOUNT OF TIME.
.S
^^MULTI-TREK\\ WAS WRITTEN IN A STRUCTURED ^FORTRAN CALLED ^^TRANSFOR\\.
^THIS ^^UIC\\ CONTAINS ALL OF THE ^FORTRAN PRODUCED BY
^^TRANSFOR\\, AS WELL AS THE ^^TRANSFOR\\ SOURCE (FILE TYPE
^^.X4S\\) AND LISTINGS (FILE TYPE ^^.X4L\\). ^DUE TO THE SIMILARITIES
OF THE VARIOUS STRUCTURED ^FORTRAN LANGUAGES IT MAY BE POSSIBLE TO
SUCCESSFULLY COMPILE THE ^^.X4S\\ FILES WITH OTHER STRUCTURED COMPLIERS
WITH LITTLE OR NO MODIFICATION.
.S
^^NOTE: T\\HIS ^^UIC\\ CONTAINS A MORE SOPHISTICATED VERSION OF ^^MULTI-TREK\\
FOR USE ON SYSTEMS HAVING THE CAPABILITY OF UNSOLICITED INPUT ^^AST'\\S AND
^^CRT\\ TERMINALS WITH PROGRAMMABLE CURSOR AND SCREEN CLEARING (USED TO PROVIDE
A CONTINOUSLY UPDATED DISPLAY).  [302,300] CONTAINS A LESS SOPHISTICATED VERSION
FOR SYSTEMS WITHOUT THESE FEATURES.
.S
^THE PROGRAMMABLE CURSOR AND SCREEN CLEARING ESCAPE SEQUENCES IN THE SOURCE CODE
ARE FOR A ^BEEHIVE 100 TERMINAL, HOWEVER, COMMENTS IN THE CODE IDENTIFY THESE
ESCAPE SEQUENCES.  ^THEY MAY HAVE TO BE MODIFIED FOR DIFFERENT TERMINALS.