Skip to content

Comment on Winner of 2011 Google AI Challenge Describes Released Code

Comments

I had fun playing around with the challenge and spent most of the time poking around with map exploration as implementing min-max once again isn't too much fun. I ended up having the most fun playing around with the idea of an anti-object . The simplicity of anti-objects combined with the low memory and low cpu overhead was very nice. Wrote it up in a little blog for others:

http://benjamin-meyer.blogspot.com/2011/11/using-collaborati...

Any ideas for a type of challenge that wouldn't be reduced to mostly min-max for the ranking, but could explore other concepts?

I actually used this idea from the forums and your post to get 683rd place even though I started on it with 36 hours to go before the deadline. http://aichallenge.org/profile.php?user=972 So thanks.

How'd you do?

AboutSource Built by g1lg1l

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