https://github.com/amogil/icfpc2012

ICFP Contest 2012 (13th place)
https://github.com/amogil/icfpc2012

Last synced: 8 days ago
JSON representation

ICFP Contest 2012 (13th place)

• Host: GitHub
• URL: https://github.com/amogil/icfpc2012
• Owner: amogil
• Created: 2012-07-10T04:29:39.000Z (over 12 years ago)
• Default Branch: master
• Last Pushed: 2013-09-11T06:51:35.000Z (about 11 years ago)
• Last Synced: 2024-10-19T15:52:41.553Z (27 days ago)
• Language: C#
• Homepage:
• Size: 2.14 MB
• Stars: 2
• Watchers: 6
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
icfpcontest2012

===============

Hack The Loop Team (13th place)

====

* Pavel Egorov (www.skbkontur.ru)

* Alexey Mogilnikov (www.skbkontur.ru)

*	Andrew Kostousov (www.skbkontur.ru)

*	Dmitry Titarenko (www.skbkontur.ru)

*	Mikhail Khrushchev (www.skbkontur.ru)

*	Alex Fetisov (www.google.com)

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