Yet another one source code:
Bot name: Oleg_Ovcharenko
Profile: http://aichallenge.org/profile.php?user=53Rank: 42Language: OCaml
Code size: 1153 + 1162 lines
I've spent some time to comment well MyBot.ml before sharing with you (yep, there are really a lot of comments). But was too lazy to document Ants.ml.
-----------------------------------------------------------------------------------------------------------------------------------------------------
My bot has usual functionality for top 100 member with small deviations:
- Search implemented via BFS. No max ply
- Battle implemented via Minimax. Full calculation for battles with <5 enemy ants; else considering only few type of enemy moves. No awareness about non-battle targets (except steping on hills). Score function depends on situation and has only 2 modes: my ants cheaper than enemy and vice versa
- Strategy flow: solving battles ---> hills defense ---> food & hills gathering (1 ant for each) ---> hills gathering (1 ant for each) ---> internal & external boundary (1 ant for each) ---> first enemy hill haunting (many ants) ---> external boundary (rest of ants) ---> enemy ants haunting ---> battles support
- Timing: between 500 and 200 ms left - solving battles; between 200 and 65 ms left - rest of stuff;