The git repository is listed on The UCC git page as "progcomp2012.git"
Direct Link Here
We will use the same mailing list as last year (progcomp).
There is a #progcomp irc channel on the ucc irc server (irc.ucc.asn.au) where you can ask questions, and someone might even answer them!
This site explains what Stratego is.
Create an AI to play Stratego.
Programs are written independently and interface through stdin/stdout with a manager program, which queries them on setup and moves.
The manager program provides the protocol for two seperate AI to play a game of stratego. It has the imaginative name of 'stratego', but I will probably refer to it as 'the manager program' or 'stratego' with absolutely no consistency.
It also aims to assist with AI design by providing options for graphical or terminal output and saving/reading games from files
Human players are also supported, although the interface is minimal, as this feature is meant for testing.
If you just want to play a game, without having to write your own AI, try Probe
Windows is not supported at this stage.
Why? Because windows doesn't have fork, or pthread, which I used to write the program because they work on linux, and I use debian.
Please report bugs to [email protected] with a detailed description, and if possible, the output of gdb, valgrind, or both :)
For the sake of simplicity and keeping things in one place, the protocol is now entirely described in the manual page of the manager program. All updates to the protocol will be reflected in that file.
Major updates to the manager program or protocol will be accompanied by an email to the mailing list. However, it is probably a good idea to clone the git repository, and regularly pull from it.
Warning: AI programs must unbuffer stdin and stdout themselves. This is explained in the manual page, but I figured no one would read it. It is fairly simple to unbuffer stdin/stdout in C/C++ and python, I have not investigated other languages yet.
The competition will be a round robin, with every AI playing six (6) games against each possible opponent. A points system is used to score each AI, 3 points for a Win, 2 for a Draw, 1 for a Loss or -1 for an Illegal response (counts as a Win for the opponent).
The winning AI will be the AI with the highest score after all games have been played. In the event of a tied score, the two highest scoring AI's will play one more round consisting of three games. If the scores are still tied, the official outcome will be a Draw.
When the competition officially runs, results will appear here. There may (or may not) be test results there now.
The scores for the preliminary rounds will contribute to 10% (each) of the final score. Scores less than zero in the preliminary rounds will not be counted.
The finals will be worth the remaining 80% of the scores.
Check out The UCC Events Page where this and other interesting things are listed!
Several sample AI programs are currently available. The sample programs can be downloaded from the git repository
Warning: No guarantees are provided about the functioning of these programs. It is your own responsibility to ensure that your submission obeys the protocol correctly. If you have based your program off a sample, please double check that it obeys the protocol.
You must submit the full source code, and build instructions or makefile(s) for your program.
Also include the name of the executable or script, the name of the AI, your name, and optionally a description of your AI and its tactics.
Please email [email protected] if you have a submission.
Code which attempts to comprimise the host machine, or interfere either directly or indirectly with the functioning of other programs will be disqualified.
The competition is now officially open. Submissions will be accepted until midday, Monday the 14th of May, 2012. Results will be announced as soon as they are available (depending on the number of entries it may take several days to simulate the competition).
Frequently Asked Questions
Please email [email protected] or post to #progcomp with any questions not on that page.
Last webpage update: 09/04/12