3.1 Program Specifications

The participant can use only C++ language. Participants must provide a link for the compiler of the programming language. The program must be executable in Windows XP/ UNIX.
The entire source code should be in one directory BKxxxx and this directory should be compressed in any of .zip or .tar.gz or .tgz.
The name of program file should be "BKxxxx.cpp" where xxxx is the Team Registration number.
The basic structure in C++ is provided to the participants. They are expected to modify the program to implement their strategy/algorithm. The guidelines for modification are provided in the code itself. The serve code is also provide. Instructions can be found on the readme file.

Click here to download the basic code in C++

The participant's source code will be included in the master code and complied.

3.2 Judging Criteria

If the number of turns is less than or equal to 1000, the code which conquers all the planets with no fleet of the opponent’s planet remaining wins the game.
If the number of turns is greater than 1000, the code which has occupied maximum planets wins. In case the number of conquered planets is same, the player with greater Missile Launch Equivalents wins.
In case Missile Launch Equivalents are also equal; the codes will be given another chance to fight against each other.

3.3 Specific Example

Consider the game is at the beginning of turn 4,

Player 1

Home planet

Planets conquered- 2 and 3

Player 2

Home Planet-16

Planets conquered- 11,12 and 15

Remaining planets are neutral with random number of Missile Launchers.

Number of Espionage Probes of player 1 = 3 (as player owns 3 planets so 3 probes, note this is the maximum number of probes player 1 can send to other planets)

Number of Espionage Probes of player 2 = 4

Status of each planet is as follows

Planet	Battle Ships	Cruiser	Missile Launcher
1	3	5	20
2	2	6	4
3	1	4	1
4	0	0	6
5	0	0	2
6	0	0	5
7	0	0	8
8	0	0	6
9	0	0	7
10	0	0	11
11	3	5	4
12	2	4	6
13	0	0	2
14	0	0	8
15	0	3	3
16	4	1	5

Player 1 does the following action

Sends Espionage Probes to planet 10 and 16.
Sends a fleet of 2 Battle Ships and 3 Cruisers from planet 1 to 5. This fleet will move with the speed of 1 unit in 2 turns, i.e. this fleet will reach its destination (planet 5) at turn 6. Refer clause 4.2
Sends a fleet of 0 Battle Ships and 3 Cruisers from planet 2 to 5. This fleet will reach the planet 5 at turn 5.
Sends a fleet of 1 Battle Ships and 1 Cruisers from planet 2 to 6. This fleet will reach the planet 6 at turn 6.
Sends a fleet of 0 Battle Ships and 2 Cruisers from planet 3 to 6. This fleet will reach the planet 6 at turn.

Player 2 does the following action

Sends Espionage Probe to planet 1, 10 and 14.
Sends a fleet of 0 Battle Ships and 2 Cruisers from planet 15 to 14. This fleet will reach the planet 15 at turn 5.
Sends a fleet of 2 Battle Ships and 3 Cruisers from planet 11 to 6. This fleet will reach the planet 6 at turn 6.
Sends a fleet of 1 Battle Ships and 1 Cruisers from planet 12 to 8. This fleet will reach the planet 8 at turn 6.
Sends a fleet of 0 Battle Ships and 2 Cruisers from planet 16 to 8. This fleet will reach the planet 8 at turn 6.

Turn 4 ends, now at the start of turn 5 the status is as follows

Player 1 occupies 1, 2, 3, and 5 planets and player 2 has its quest over the planets 16, 11, 12, 13 and 15.

The current status of all the planets is as follows…

Planet	Battle Ships	Cruiser	Missile Launcher
1	3-2+2 = 3	5-3+4 = 6	20+4 = 24
2	2-0-1+1 = 2	6- 3-1+2 = 4	4+3 = 7
3	1-0+0 = 1	4-2+3 = 5	1+2 = 3
4	0	0	6+2 = 8
5	0	1	0
6	0	0	5+1-4 = 2
7	0	0	8+2 = 10
8	0	0	6+1 = 7
9	0	0	7+3 = 10
10	0	0	11+1 = 12
11	3-2+1 = 2	5-3+2 = 4	4+3 = 7
12	2-1+2 = 3	4-1+3 = 6	6+1 = 7
13	0	1	0
14	0	0	8+2 = 10
15	0-0+2 = 2	3-2+3 = 4	3+2 = 5
16	4-0+2 = 6	1-2+4 = 3	5+4 = 9

Note – minus (-) are the fleet sent and plus (+) are according to the rate of production of ships

The case discussed above is just a hypothetical possibility used to explain the process.

View the Rules >>