From 451c60e0e37013ecf85360bad290d454b94c5477 Mon Sep 17 00:00:00 2001 From: Sam Moore Date: Sat, 17 Mar 2012 16:52:56 +0800 Subject: [PATCH] Made the webpage simpler. --- web/index.html | 126 ++++++++++++++-------------------------------- web/oldindex.html | 99 ++++++++++++++++++++++++++++++++++++ 2 files changed, 136 insertions(+), 89 deletions(-) create mode 100644 web/oldindex.html diff --git a/web/index.html b/web/index.html index 2a50bca..77254f6 100644 --- a/web/index.html +++ b/web/index.html @@ -5,95 +5,43 @@ -

Quick Details

git

The git repository is listed on The UCC git page as "progcomp2012.git"

Direct Link Here

UCC::Progcomp 2012

Note: This page has been updated to minimise frustration.

+ + +

First, login to a linux clubroom machine, that actually works. Machines to avoid include all of them.

Next, open a terminal and do this:

ssh -X motsugo
cd /away/ucc/username
git clone git://git.ucc.asn.au/progcomp2012.git
cd progcomp2012/judge/manager
./stratego -g -b @human ../../agents/vixen/vixen.py

Now play a game.

Now:

mkdir ../../agents/my_ai
cp ../../agents/basic_python/* ../../agents/my_ai/
mv ../../agents/my_ai/basic_python.py ../../agents/my_ai/my_ai.py

Now, open gedit, and open the file "progcomp2012/agents/my_ai/my_ai.py

Write an AI. Test it with: "./stratego -g -b @human ../../agents/my_ai/my_ai.py"

Also test with "./stratego -g ../../agents/my_ai/my_ai.py ../../agents/vixen/vixen.py"

Keep doing this until you win.

+ +

DO NOT

Attempt to compile the manager program for Mac
Attempt to compile the manager program for Windows
Attempt to get OpenGL working on any computer.
Attempt to get SDL working on any computer.
Attempt to implement the protocol from scratch unless your name is John Hodge.

+ +

More information:

Visit the old page

Mailing List

We will use the same mailing list as last year (progcomp).

- -

irc channel

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!

- -

Stratego

This site explains what Stratego is.

- -

Programming Competition

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

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 Support

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.

- -

Bug reports

Please report bugs to matches@ with a detailed description, and if possible, the output of gdb, valgrind, or both :)

Known Bugs

Ash reported a segfault upon every program start, running under Ubuntu. I can't replicate this bug, and don't have any other information.

- -

Screenshot

Graphical output of 'stratego' manager program.

- -

Protocol

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.

- -

Scoring and Results

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.

- -

Rounds and Events

10th March 2012 - Progcomp Day - Sam will be in the UCC clubroom to explain stuff and help people
?? - Preliminary Round 1 - Gives entrants a chance to test their AI against others. Not worth any points.
?? - Preliminary Round 2 - Scores less than 0 are not counted. Scores above 0 are weighted by 0.1
14th May 2012 - Round 1 - The main event.
?? - Winner and prize announcement - The creator of the AI with the highest score is the winner

- -

Sample AI Programs

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.

Submissions

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 matches@ 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.

- -

Dates

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).

- -

Clarifications

We are using the newer rules described here.
Scouts may move multiple spaces and attack in the same turn (in some versions they cannot).
Bombs remain in place until destroyed by a Miner (some versions incorporate "single-use" Bombs).
Victory is possible by either capturing the enemy Flag, or destroying all mobile enemy pieces. - AI programs do not have to "surrender" (as stated in the rules) if they have no mobile pieces. The manager program should end the game (if it does not, please report the bug)!
The newest versions of the physical board game reverse the numbers of the ranks (10 is the Marshal, 1 is the Spy). Our system uses the original numbering (1 is the Marshal, 9 is the Scout and s is the Spy).
You must always make a move.
Remember to unbuffer stdin/stdout!

- -

Questions?

Frequently Asked Questions

Please email matches@ or post to #progcomp with any questions not on that page.

Last webpage update: 03/02/12

- + diff --git a/web/oldindex.html b/web/oldindex.html new file mode 100644 index 0000000..2a50bca --- /dev/null +++ b/web/oldindex.html @@ -0,0 +1,99 @@ + + + Stratego Based Programming Competition + + + + +