Index of /~oiwa/icfp-contest-2002/source

 Name                    Last modified       Size  Description

 Parent Directory        09-May-2003 06:17      -  
 Makefile                03-Sep-2002 01:51     1k  
 Makefile.config         03-Sep-2002 01:55     1k  
 OCamlMakefile           03-Sep-2002 01:29    20k  
 board.ml                03-Sep-2002 01:29     1k  
 dijkstra.ml             03-Sep-2002 01:29     8k  
 forecast.ml             03-Sep-2002 01:29     9k  
 interactive.ml          03-Sep-2002 01:29    11k  
 main.ml                 03-Sep-2002 01:29     1k  
 map_analyze.ml          03-Sep-2002 01:29     2k  
 mst.ml                  03-Sep-2002 01:29     3k  
 printer.ml              03-Sep-2002 01:29     3k  
 protocol.ml             03-Sep-2002 01:58     6k  
 schedule.ml             03-Sep-2002 01:29     1k  
 strategy.ml             03-Sep-2002 01:29     6k  
 types.ml                03-Sep-2002 01:29     1k  

               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.