
 "Sam sat on the ground and put his head in his hands.  'I wish I had never
 come here, and I don't want to see no more magic,' he said, and fell silent."


This is the London.pm entry to the The Fifth ICFP Programming Contest 
(http://icfpcontest.cse.ogi.edu/).  It's called Marvin.

*** BASICS 

Marvin is written in pure Perl 5.  It doesn't depend on any non-core modules.

*** HOW DOES IT WORK?

Path-finding:
   Marvin implements an iterative solution of the popular A* algorithm.

Package selection:
   Marvin uses two techniques to decide which packages to fetch from a base:
   -  First, choose packages that are all going to the same destination.
   -  Second, choose packages with lower weights that might not fit our
      capacity optimally, rather than filling our capacity completely with
      heavier packages.  (Which isn't only very hard, but is also not a great
      idea in a game with combat - if we're going to drop a package, it makes
      sense to drop one weighing a small amount, affecting our points less.)

Combat:
   Marvin makes no attempts to engage or avoid combat.

*** AUTHORS

Team:     The London Perlmongers <http://london.pm.org/>.
Authors:  Leon Brocard <leon@astray.com>, Chris Ball <chris@void.printf.net>.
