Loading...
Coordination is the key!
The purpose of the game is to build a multi-agent system meant to clean a given area as efficiently as possible. The various types of agents available in the system (scouts, harvesters, carriers), endowed with different sensing, acting and communicating abilities, must cooperate and coordinate in order to recycle as much garbage as possible in the given amount of time.
The proposed solution must take into account the characteristics of the map, the different types of garbage and the states in which it can be found on the map. It should also cope with damages that might occur.
For complete specifications of the game, please check out the Recycle Swarm Rulebook and Tutorial. Javadocs for the framework are also avaialble. To download the SDK, you need to be logged in.
Awards
The winning team is awarded a prize of 1.000 Euros!
Important dates
| Solution Submission for Testing Round #1* | December 19th, 2010 |
| Testing Round #1 | December 20th, 2010 |
| Solution Submission for Testing Round #2* | January 20th, 2011 |
| Testing Round #2 | January 21st, 2011 |
| Solution Submission for Testing Round #3* | February 6th, 2011 |
| Testing Round #3** | February 7th, 2011 |
| Solution Submission for Qualifications* | February 11th, 2011 |
| Qualification Round | February 12th, 2011 |
| Final Solution Submission Date* | February 16th, 2011 |
| The Finals | February 19-20, 2011 |
* All submissions until 24.00h (GMT+2)
** Additional testing round. Participation is also optional.
How do I get to the finals?
A qualification round (QR), having two stages, will take place on February 5th, 2011.
First stage
All submitted valid solutions will play against an opponent developed by the organisers. The matches take place on the same map, in the same conditions. The first 16 teams with the highest scores pass on to the second stage, forming 4 groups of 4 teams each.
Second stage
Each team will play against each of the other teams in its group. This means that there will be 3 games played in each group. A game consists of 3 rounds played on different scenarios. A round can not end with a draw. In case of a draw, the round is played again. The team that wins 2 rounds is therefore declared the winner of the match.
Points are awarded to each team for each match, according to the following table:
| Result | Points earned |
| win | 2 |
| draw | 1 |
| loose | 0 |
The first 2 teams earning the highest scores in each group will qualify for the finals. This sums up to a total of 8 teams qualified to the finals, having a total of 4 favorites – the first team of each qualification group.
In case there are two or more teams tied for the finals, tie games will be played. A tie game consists of 3 rounds, similar to the ones played during the groups phase. A tie game is decisive.
Note: The format of the QR is dependent on the number of valid solutions submitted:
- If the number of valid solutions submitted for the QR is greater than 8, but less than 16, the number and format of the groups will be announced within12 hours following the submission deadline for the QR.
- If the number of valid solutions submitted is less than or equal to 8, all the solutions will automatically qualify to the finals after the first stage. The teams earning the highest scores will be considered as favorites during the final tournament.
The Finals
The teams qualified to the finals will enter a tournament-like structure. The final form of the tournament is dependent of the number of valid solutions submitted for the QR and will be announced within 12 hours following the submission deadline.
A match during the final tournament is decisive and consists of 3 rounds. Each round is played on a different map.
See also: General Rules
