Revision as of 07:08, 22 March 2006

Haskell Algorithm Challenge (HAC!)

Required framework:

possibility to register for darcs repo, see http://www.equational.org/darcs-server/
mailing-list for idea suggestions

Format:

1 week for submission, 24 hours lightning round
Each contest should focus (e.g. graph-related logic) on one topic, but wrap it in some sort of fun game/competition
- By focussing on one topic it will most likely be more informative to people studying those topics
- It might be possible to promote the use of new libraries through a common darcs repo people can use for contests (for instance NewBinary, PackedString)
Need for wrapup after each contest such that interesting code can be refactored into the common darcs repo
Problems should be open, such that newbies can make naive solutions but advanced coders can still have room to explore in
Extra points for readability and documentation so it can be reused more easily in the generic darcs repo

Contributors:

@@ Line 10: / Line 10: @@
 ** By focussing on one topic it will most likely be more informative to people studying those topics
 ** It might be possible to promote the use of new libraries through a common darcs repo people can use for contests (for instance NewBinary, PackedString)
+* Need for wrapup after each contest such that interesting code can be refactored into the common darcs repo
+* Problems should be open, such that newbies can make naive solutions but advanced coders can still have room to explore in
+* Extra points for readability and documentation so it can be reused more easily in the generic darcs repo
 Contributors: