Hello Codeforces Community,
HackerEarth invites you to a AI type contest — Bot Challenge. The contest will start on March 11, 20:00 IST and will last for almost a week.
You have to build a bot that plays a two-player game (like Tic-tac-toe or Chess) with a bot built by another user. At the end of challenge, your bot will play in a tournament against all other bots, and the bot that wins the tournament will be declared the winner.
Also, while the contest is running, you can challenge other people who have submitted their bots to play against you.
The link to the contest: https://www.hackerearth.com/battle-of-bots-3/
You can practice in previous Bot contests(#1, #2, India-Hacks), to understand more about the problem statement and the format of the contest.
Fun fact: Gullesnuffs has won all the Bot challenges as of now. Will he be finally dethroned? I doubt.
You can check out this gameplay between Gullesnuffs and another contestant in the India-Hacks Bot challenge. Click on the replay button there to watch it.
Have fun!
50 more hours for the contest to end. :)
Can the top users discuss their approach for their respective solutions?
I just wrote a vanilla MCTS.
Can you explain it in detail? I don't really understand how your code beats my optimized O(7^number_of_steps) algorithm with memoization, heuristics, rng, and all possible bells and whistles.
UPD: congrats about your new red color.
I think I'll let the wiki article explains for me :D https://en.wikipedia.org/wiki/Monte_Carlo_tree_search
UPD: think about it, instead of adding rules ourself, we let the machine do all the jobs