Algorithm

• The algorithm must use N (and M) as input parameters. N is the number of candidate stars and M is the subset length, which for this competition will always be 4. For the CSV file that has to be submitted, the output for N=20 and M=4 is to be used.
• The code must produce the sequence within 1 second. The reference platform is the submissions server (kelvins.esa.int).

Submission

• The submission needs to be a ZIP file with a size of 1 MB maximum containing exactly two files.
• One file is the python code (ending with .py) which can be either Python 2 or 3.
• Only libraries available in pypi are allowed.
• The sequence generated by your algorithm as a header-less CSV file called sequence_20_4.csv.
• The CSV file has exactly 4 columns and a maximum of 4845 subsets (lines).
• The cells in the CSV file contain star IDs, which are integers from 0 to 19 (inclusive).
• The CSV file shall not contain invalid subsets (duplication of star IDs).

General

• Only current and previous members of the European Space Agency are allowed to participate.
• No teams are allowed.
• All participants must submit their source code under an OSI-approved license. If no license is mentioned in the file, GPL 3 is assumed.
• No cheating!

The competition ends on 2016-01-10 at 00:00:00 CET.