Skip to content
ICFP Contest 2012 (13th place)
C#
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
icfpc2012
maps
submit
tests
.gitignore
README.md

README.md

icfpcontest2012

Hack The Loop Team (13th place)

Russia, Ekaterinburg city.

We had used Immutable persistent Quad-tree as a Game Field. All operations O(log size)

Logic:

Basic algorithm (GreedyBot):

  • Safely gather closest lambda/razors, without dropping rocks.
  • If none - gather some lambda/razors with dropping rocks.
  • If none - move some rocks.

"Smart" algorithm (TimeAwaredBackTrackingGreedyBot):

  • Run basic algo. It gives us some answer.
  • Give extra priority to some lambda and run basic algo. It gives us some another answer. Choose the best one.
  • Repeat last step while have enough time

Testing:

Tests/Brains/TestGreedyBot - regression test

You can’t perform that action at this time.