Subversion Repositories shark

/*--------------------------------------------------------------*/
/*              SIMULATION OF THE HUNGRY SNAKE'S GAME           */
/*
 PROJECT DONE BY  :
  NAME    :SUNDARA PRABU
  SURNAME :THESINGU RAJAN

   EMAIL  : Y2KPRABU@YAHOO.COM

   DEVELOPED SYSTEM : AMD DURON 1.1GHz 128MB RAM SVGA MONITOR
   OS     : SHARK
   GCC    : 3.1 (DJGPP VERSION)

   UNDER THE GUIDANCE OF PROFESSORS:
    Mr. Giorgio Buttazzo    <giorgio@sssup.it>
    Mr. Giuseppe Lipari     <lipari@sssup.it>
    Mr. Paolo Gai           <pj@gandalf.sssup.it>

*/
/*--------------------------------------------------------------*/
HELP FILE FOR HUNGRY SNAKES GAME..

AIM :

 TO EAT THE LARGEST NO OF FRUITS
 WITHOUT HITTING ANY STONES ,WALL AND THE OTHER SNAKE.
 IT SHOULD NOT CROSS ITS OWN BODY ALSO.

 FRUITS :

  THEY ARE CIRCULAR IN SHAPE AND APPEAR IN
   RANDOM COLOURS AT RANDOM POSITIONS FOR
   RANDOM TIME.
   ON PASSING OVER THE SNAKES ,U SCORE BONUS
   1000 POINTS.

 STONES:

   THEY ARE RED COLORED RECTANGULAR BRICKS.
   IF THE SNAKE HITS THEM IT DIES.

 BUGS :
  THE BOUNDARY WALLS MAY NOT BE OF EXACT PRECISION
  DURING CRASHES.
  THE TWO SNAKES DIE ONLY WHEN THE SNAKE PIERCES TO
  SOME EXTENT INSIDE THE OTHER SNAKE.
  THE FRUIT MIGHT APPEAR ON THE SNAKE BODY !! (OOPS)
  AFTER THE SNAKE HAD EATEN A FRUIT, A HOLE IS PRODUCED
  ON THE SNAKES BODY..(...:O)

 HOW TO PLAY :
  THIS A 1 OR 2 PLAYER GAME, +
  U CAN CHOOSE THE MODE WHILE ENTERING,
  SPACE BAR :START GAME
  ESC       :EXIT GAME
  PLAYER 1.
  S  : UP
  X  : DOWN
  Z  : LEFT
  C  : RIGHT

  PLAYER 2.
  L  : UP
  ,  : DOWN
  M  : LEFT
  .  : RIGHT

  THE INSTRUCTIONS FOR PLAYING ARE AT THE BOTTOM OF
  THE SCREEN

  WINNER :
   THE SNAKE WHICH STAYS ALIVE FOR A LONGER TIME IS THE
   WINNER , EVEN IF IT HAS LESS POINTS.

  FOR ANY SUGGESTIONS MAIL TO  y2kprabu@yahoo.com