![]() About News Documentation Q&A Screenshots Bot Library Download Forum (external) DB portal (external) Tournaments TODO ChangeLog Development Contact Links ![]() |
KOTH Contest !I am right now testing an automatic KOTH tournament running one round every hour on the adress droidbattles server The latest round is available here Feel free to enter your bots in this testtournament Old KOTH contestRound 16 fought :Round sixteen Round fifteen Round fourteen Round thirteen Round tvelwe Round eleven Round ten Round nine Round eight Round seven Round six Round five Round four Round three Round two Round one . CURRENT King Of The Hill: lgnom.bot by Peter Schmidt RulesThere is four classes (ultralight,light,medium,heavy) using the respective config files (Included in the distribution). For the tournament to start for one of the classes I will have to have received at least 5 entrants for that class, and at least three different authors should have entered bots. If there is to few entrants in a class I will simply wait with that class till next week. One round will be fought each week. The version of DroidBattles used will always be the latest made available. This can admittedly create som differences in behaviour when versions are changed. Each match will consist of 15 fights, And each fight goes on in 6000 cycles. The size of the Battlearea is 32768*32768. Entering botsIf you want to enter your bot in a class make sure it runs under that config file without complaining and send it to me to Bluefire@bluefire.nu and tell me which class(es) you want it entered in. Entrants made available for me sunday morning CET will get added into the KOTH table in that weeks run. You may send updates to your existing bots in the KOTH table, and you may revoke your bots from the contest at any time. I will accept both .basm source files and/or .bot binary files as well as your customized graphics, should you have any. The maximum number of bots you may have in a class at once is 3. (which counts up to 12 for all 4 classes, which should be sufficient). Happy coding! |
|
Made by Andreas Agorander 2000, e-mail |