Hacker News Board Hacker News, browsed like a classic message board
Live data from Hacker News

Winner of 2011 Google AI Challenge Describes Released Code

xathis.com

Post reply on HN
Print view View original

1–10 of 23 posts

Re: Winner of 2011 Google AI Challenge Describes Released Code

#3

Post by peregrine »

Now this is what I go to HN for! The most interesting part for me was that he did not focus on some huge strategy. Just individuals and small groups with clear goals and constant revaluation. Keeping in mind that the only thing kept between rounds were missions and those were constantly reevaluated as well. I think this is a vivid, albeit simplified, example of how successful organizations of anything should operate.

EDIT: grammar

Re: Winner of 2011 Google AI Challenge Describes Released Code

#4

Post by icefox »

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?

Re: Winner of 2011 Google AI Challenge Describes Released Code

#5

Post by memnips »

Unfortunately the link appears to be temporarily dead. Luckily before you read about his bot you should watch it play anyways!

Here are two replays of the same map. The first is played by average players and the second is played by xathis (and other top bots).

Avg: http://aichallenge.org/visualizer.php?game=335973&user=8... Top: http://aichallenge.org/visualizer.php?game=329760&user=4...

Re: Winner of 2011 Google AI Challenge Describes Released Code

#8

Post by tvorryn »

LearnYouALisp wrote: post #7

The first lines seemed familiar: http://quotenil.com/Planet-Wars-Post-Mortem.html

Haha. It didn't say that before, because he hadn't officially won yet. It's actually been propagated from Tron: http://a1k0n.net/2010/03/04/google-ai-postmortem.html

Re: Winner of 2011 Google AI Challenge Describes Released Code

#9

Post by LearnYouALisp »

tvorryn wrote: post #8
LearnYouALisp wrote: post #7

The first lines seemed familiar: http://quotenil.com/Planet-Wars-Post-Mortem.html

Haha. It didn't say that before, because he hadn't officially won yet. It's actually been propagated from Tron: http://a1k0n.net/2010/03/04/google-ai-postmortem.html

It seemed like a tradition, but strangely Google only showed his page at the top.

Re: Winner of 2011 Google AI Challenge Describes Released Code

#10

Post by tvorryn »

icefox wrote: post #4

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…

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?

Post reply on HN