The meandering ways of Sir Bedevere the Wise

The meandering ways of Sir Bedevere the Wise

What's this?

This is the blog of a team that competes in the annual ICFP programming contest

Our code up for grabs

ICFP 2009Posted by Pär Bohrarper Wed, July 01, 2009 22:23:38
Our code for this year can be found here:

http://bitbucket.org/rogueops/icfp2009

Visualizing orbits

ICFP 2009Posted by Pär Bohrarper Wed, July 01, 2009 18:29:02
This is a video of our visualizer in action.


Effort spent

ICFP 2009Posted by Pär Bohrarper Tue, June 30, 2009 10:12:10
Here's the output of sloccount for this year's effort. To be fair, we re-used a vector class and some other bits and pieces from previous years. But still, where can we get our $50,000?

Creating filelist for src
Categorizing files.
Finding a working MD5 command....
Found a working MD5 command.
Computing results.


SLOC Directory SLOC-by-Language (Sorted)
1913 src python=1618,ansic=291,sh=4


Totals grouped by language (dominant language first):
python: 1618 (84.58%)
ansic: 291 (15.21%)
sh: 4 (0.21%)




Total Physical Source Lines of Code (SLOC) = 1,913
Development Effort Estimate, Person-Years (Person-Months) = 0.40 (4.74)
(Basic COCOMO model, Person-Months = 2.4 * (KSLOC**1.05))
Schedule Estimate, Years (Months) = 0.38 (4.52)
(Basic COCOMO model, Months = 2.5 * (person-months**0.38))
Estimated Average Number of Developers (Effort/Schedule) = 1.05
Total Estimated Cost to Develop = $ 53,388
(average salary = $56,286/year, overhead = 2.40).
SLOCCount, Copyright (C) 2001-2004 David A. Wheeler
SLOCCount is Open Source Software/Free Software, licensed under the GNU GPL.
SLOCCount comes with ABSOLUTELY NO WARRANTY, and you are welcome to
redistribute it under certain conditions as specified by the GNU GPL license;
see the documentation for details.
Please credit this data as "generated using David A. Wheeler's 'SLOCCount'."

Screenshots

ICFP 2009Posted by Pär Bohrarper Mon, June 29, 2009 20:28:15
Here are some screenshots of our visualizer for your enjoyment!


Final score

ICFP 2009Posted by Dan Gerhardsson Mon, June 29, 2009 20:00:50
After lot of struggle with the flight path time calculations we managed to get good scores on all Eccentric Meet and Greet problems. Scored a few points on 4001-4003 also, using more or less the same solution, but we didn't have time to exploit the fuel station. Final score is 2828.

Äntligen

ICFP 2009Posted by Pär Bohrarper Mon, June 29, 2009 12:21:20
Finally! Success on Eccentric Meet and Greet!

Problems

ICFP 2009Posted by Dan Gerhardsson Sun, June 28, 2009 22:51:25
Not much progress today. We discovered that our submissions could fail verification although they worked in our simulator. It turned out to be a small bug in the VM which was really hard to track down. Now it is ok again, and the detection of elliptic orbits also seems to work. Hopefully most things are in place to attack the Eccentric Meet and Greet problems.

Rendez-vous is working!

ICFP 2009Posted by Pär Bohrarper Sun, June 28, 2009 01:55:30
Yay! We got the 2001-2004 scenarios working. New score: 1000.1324, currently place 44. Not too shabby..

Next »