Difference between revisions of "HAC"
Jump to navigation
Jump to search
| Line 9: | Line 9: | ||
* Each contest should focus (e.g. graph-related logic) on one topic, but wrap it in some sort of fun game/competition |
* 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 |
** 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) |
||
Contributors: |
Contributors: |
||
Revision as of 06:59, 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)
Contributors:
- dons
- shapr
- vincenz