ICFP 2002 Programming Contest

Team Name: TAPLAS

Program Name: Rog-O-Matic III

Details: This is the standard (non lightening) divistion entry. The
members are Yutaka Oiwa, Eijiro Sumii, and Tatsurou Sekiguchi.

The strategy we adopted is in principle based on Dijkstra's shortest
path finding algorithm. A robot must go to homes, pick up packages,
carry them to thier destinations, and drop them at the appropriate
place. Those actions are rated by distances (which are computed by a
clever evaluation function), and then the most appropriate one is
chosen by Dijkstra's algorithm. In addtion, finding a path along which
the robot does not have a collision with the other robots is also
realized in the evaluation function of distance.


Build Proceduce:
  This submission contains statically-linked binary on Debian Linux.
  Sources are included in the source directory (GNU MAKE and
  ocaml-3.06 required).


Execution Procedure:
  Execute runme.