Skip to content

xoposhiy/icfpc2012

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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

About

ICFP Contest 2012 (13th place)

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • C# 100.0%