| FvdP HOME > Main index > Programming contests |
|
|
I participated several times to the Programmer Of The Month contest, and won two times, once in collaboration with Pavel Ouvarov. Pavel is now running his own programming contest, while the POTM is suspended for an indefinite time.
Pah-tum is a variant of Go-moku played on a 7x7 board. The game does not end when an alignment is made, but when the board is full; then, all alignments receive points according to their lengths.
Grab here the source code (C++) of my entry, Carnac. I was placed 10th or so.
You receive a square board and a line that cuts it in two pieces. Your aim: add up to nine (ten?) line cuts so as to minimize the area difference between the largest and the smallest pieces.
I've written a
visual interactive interface
to play with the best entries !
(for Windows only...) (version 1.01)
Here is a snapshot (52K) of that interface which not-so-incidentially
displays a score 54 solution to the original test problem
(line (0;38)-(20;0)) - found by Yalta.
In this problem you get a rectangular board filled with letters and a list of words, then you must cover the biggest possible part of the board with non-overlapping words that appear in the list.
The winning entry written by Jaco Cronje uses a genuine genetic algorithm, with a clever cross-over operator. Much like my entry actually, except that my cross-over operator was too dumb...
Available items:
| FvdP HOME > Main index > Programming contests (top of page) |