Revision: 776
http://assorted.svn.sourceforge.net/assorted/?rev=776&view=rev
Author: yangzhang
Date: 2008-05-09 00:37:44 -0700 (Fri, 09 May 2008)
Log Message:
-----------
added a readme
Added Paths:
-----------
battlecode-2007-little/trunk/README
Added: battlecode-2007-little/trunk/README
===================================================================
--- battlecode-2007-little/trunk/README (rev 0)
+++ battlecode-2007-little/trunk/README 2008-05-09 07:37:44 UTC (rev 776)
@@ -0,0 +1,29 @@
+Overview
+--------
+
+This is [Greg] and my jumbled heap of code produced for the BattleCode 2007
+programming competition at MIT.
+
+Our overall strategy can be described as follows: our four archons stuck
+together and spawned a large cluster of scouts (and I believe soldiers, but for
+the longest time we were convinced that four tanks were the way to go).
+Whenever we encountered the enemy, we buckled down until we destroy their
+units.
+
+One highlight of this code was definitely Greg's regular-expression encoding of
+Dijkstra's algorithm, which allowed us to perform perfect path-finding but
+without incurring tons of instructions (since calls to standard library
+routines such as regular expression substitution had a low constant cost). For
+this hack we won a Sony PSP.
+
+Another neat feature was our EMP-spawning strategy: whenever we saw an enemy
+archon, one of our scouts (somewhere in the middle of our cluster) would evolve
+into an EMP, which would then pursue the archon. The other scouts would
+concentrate on defending (clearing a path) for this EMP by walling off and
+attacking potential threats.
+
+Other than the above information, I'm afraid I can't recall much else about our
+entry. I can't even remember which of the directories to point you to if you
+wanted to see our final submitted player. ...Yeah.
+
+[Greg]: http://glittle.org/
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
