Photos of on-site Sharif AI Challenge

Photos of Sharif AI Challenge 2016 are reachable in telegram.me/AICHPH.

Final results of the side-contest

We are pleased to announce that the results for the side-contest have been finalized with the matches held for all the 16 teams.The results are as follows:

1."Enderman" from Isfahan University of Technology

2."2+1" from Sharif University of Technology

3."AJAPACK" from Isfahan University of Technology

Moreover, you can check out the matches held and their results via the "my team" section of the website.

Final Ranking of Sharif AI Challenge 2016

The last stage in the tournament has been held and the contest ended with the champion acknowledged.

This stage was held with the top 48 teams in the online stage on 2nd and 3rd of March in Computer Engineering department of Sharif University of Technology.

The final ranking is as follows:

1) DOS-Deeper-Faster

2) We Did Not Agree On The Name

3) Max Payne

Maps used in Qualification matches

The maps used for the qualification matches are uploaded on the "resources" page.

Result of selection phase of the competition

Congrats to you all for being with us until here, with the continuous efforts of our technical team, the primary rankings are ready to be announced.

513 teams participated in this tournament, 424 of which finalized their registration. 216 out of the 424 finalized teams, submitted their codes and were participated in the final results.

You can see the primary rankings in here.

Also you can observe your games in the "my games" tab of "my team" section in the website; you can check how your ranking has been evaluated by the following instructions:

Seeding: Each team plays 3 matches on 3 different maps with the random AI, which you can see the scores based on these games in this page.

According to this ranking, the grouping process is finished as described; 1st-20th teams in the first group, 21th-40the teams in the second group and so on in the 10th group. 201th-216th teams are placed in the supplementary group.

Qualification: Here every team plays against one team from each group, on two different maps. The primary ranking is evaluated by these 20 matches for each team. 

Supplementary: Note that the 16 teams existing in the supplementary group also play a match against one team from each group, but the scores are only counted for these 16 teams, so the score other teams have received in these matches are not counted in their final score for the primary ranking.

As it could be noted, 4264 matches were held in this stage.

Please note that technical team has taken everything into account so the maps are selected in a way that no strategy has obvious advantages. Moreover, the maps have been designed such that the two teams are in the exact same spot and state in initially. (Although in some maps it might be hard to recgonize this equality and parallelism easily in the beginning, with a little more accurate look you can find the parallelism in the mail.)

While watching the game, if your player doesn't move it means that your code has run into an error or your time limit has been exceeded. The technical team have done their best to check suspicious situations to ensure that the problem was caused by the code and there's no problem with the procedure of the contest.

Despite all the efforts the technical team has put together to control the performance and faultless execution of each match, you can let us know if you have any objections about the procedure of ranking or the score,via the "contact us" section or directly through [e-mail], explaining your objection in details ,by Tuesday February 23th, 20:29. The objections won't be investigated after this time.

Should any problems come up, you can contact the secretariat of the contest by dialing [phone].

The top 48 teams will be participating in the on-site stage. If any of these 48 teams doesn't have the possibility to participate in the next stage, the next available team by the ranking will replace that team. Also the top 16 teams among the teams that don't have the possibility of participating in the next stage will be participated in another independent tournament.

More information about participating in the on-site stage of the contests will be provided soon.

Announcing the result of Online Phase

Concerning the huge number of teams participating in the contest ,the number of matches held for each one, which approximately reaches 4K for this stage, and the 1-minute time of each match, simulating the games takes rather a long time. 

The technical team is currently managing the games in tandem to minimize the time needed to hold all of the games, making the primary ranking available as soon as possible.

We are doing our best to make that happen by the end of Monday February 22nd.

Possibility to resubmit your codes

Dear participant,

Due to the problems that many teams encountered during code submission   

code submission will be open from 14:30 to 20:30 GMT today 20 February 2016 and this will be the last chance to submit a working code.

Note that you should submit codes in zip format and no other format will be accepted. Only submissions that are successfully compiled will enter the competition.

Also we do not install any external libraries for you (e.g. numpy, scipy, boost) and you should upload the neccesary files with your code if you intend to use them.

End of Online phase

Online phase is ended now and teams can not submit codes anymore.

From now on, programs will compete each other as informed earlier and the result will be announced in a few days.

Moreover, we have to apologise because despite the technical team's continuous efforts to prepare the necessities to make friendly matches possible, it could not be arranged due to lack of stability.

It should also be noted that this feature was designed to improve your codes quality and its absence does not  intrude the contest's core planning.

Map Designer

Map designer for Windows is now added to game resources page.

Unfortunately map designer for Mac and Linux is under development and will be released as soon as possible.

Solved partial problem

The partial problem with the time retriever function in C++ language has been resolved.