Skip to content

Comment on Winner of 2011 Google AI Challenge Describes Released Codeparent

Comments

You didn't do too badly this time yourself. 11th place. Looking at what he did, do you see what you could do to improve your bot further?

Sure, but as he concludes at the end, I didn't want to spend too much time on it. My bot was fairly unique in that it used Monte Carlo methods rather than deterministic minimax, and it got the job done without too much effort. I wrote a forum post describing the basic approach here: http://forums.aichallenge.org/viewtopic.php?f=24&t=2044

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.