Lisp developer walks away with Google AI contest
1–10 of 75 posts
Re: Lisp developer walks away with Google AI contest
#2A better title: "3 Time Winner of Computer Games Olympiad Wins Yet Another Contest".
Re: Lisp developer walks away with Google AI contest
#3Is there a summary of the algorithms he used anywhere? I don't see how it was the language that won the competition, rather than the code he wrote in it.
Re: Lisp developer walks away with Google AI contest
#4Is there a summary of the algorithms he used anywhere? I don't see how it was the language that won the competition, rather than the code he wrote in it.
Looks like alpha beta with a good evaluation function, move ordering, and a changing depth parameter (not sure about this one, though).
Re: Lisp developer walks away with Google AI contest
#5I know at least a few people who had bots written in/were prepared to write bots in Clojure. They didn't end up adding support for it, however. I still can't wait for the next contest—wouldn't Pentarow be cool? Or Pente?
Anyway, cheers to Waterloo for putting this on again!
Re: Lisp developer walks away with Google AI contest
#6Is there a summary of the algorithms he used anywhere? I don't see how it was the language that won the competition, rather than the code he wrote in it.
Looks like alpha beta with a good evaluation function, move ordering, and a changing depth parameter (not sure about this one, though).
Isn't alpha-beta pruning a type of optimization you can do to a search algorithm, but not the base algorithm itself? I only bring this up since I helped make an Othello bot that used Mini-max _with_ alpha-beta pruning to help reduce the number of branches it needed to follow down a tree.
Re: Lisp developer walks away with Google AI contest
#7Hmm .. maybe I should consider settling in Hungary.
Re: Lisp developer walks away with Google AI contest
#8Earlier quoted context omitted.
Looks like alpha beta with a good evaluation function, move ordering, and a changing depth parameter (not sure about this one, though).
Isn't alpha-beta pruning a type of optimization you can do to a search algorithm, but not the base algorithm itself? I only bring this up since I helped make an Othello bot that used Mini-max _with_ alpha-beta pruning to help reduce the number of branches it needed to follow down a tree.
Alpha-Beta pruning is, to my knowledge, only really defined in a mini-max setup. By definition, it leverages the mini-max framework to prune areas of the search space.
You can apply the core concept -- refusing to expend computation effort when the result of that effort is guaranteed to not be used -- to any number of other methods and approaches in Machine Learning and AI.
Re: Lisp developer walks away with Google AI contest
#9Earlier quoted context omitted.
Isn't alpha-beta pruning a type of optimization you can do to a search algorithm, but not the base algorithm itself? I only bring this up since I helped make an Othello bot that used Mini-max _with_ alpha-beta pruning to help reduce the number of branches it needed to follow down a tree.
Alpha-Beta pruning is, to my knowledge, only really defined in a mini-max setup. By definition, it leverages the mini-max framework to prune areas of the search space. You can apply the core concept -- refusing to expend computation effort when the result of that effort is guaranteed to not be used -- to any number of other methods and approaches in Machine Learning and AI.
As far as the first line in the wikipedia page goes..."Alpha-beta pruning is a search algorithm which seeks to reduce the number of nodes that are evaluated by the minimax algorithm in its search tree."[1] it seems like you're correct. Thanks.
Re: Lisp developer walks away with Google AI contest
#10Hmm .. maybe I should consider settling in Hungary.
food's better and cheaper... thats for sure.