Artificial
Intelligence

Fall 2011

course

navigation

sep 20

So ... where are you?

readings from the text
coding searches ?

The wikipedia search algorithms have a lot on this topic; see

http://en.wikipedia.org/wiki/Alpha-beta_pruning
... and the others in the links on that page

I have some detailed minmax and alphabeta TicTacToe code in perl that might be worth looking at.

More on lisp

I spent way too much in lisp this weekend...
I've attached some notes that may be helpful.
I have a breadth/depth search for a very simple tree in search
.. as well as a start on topspin stuff, and a unit test example

Alex likes http://blog.viridian-project.de/2008/04/06/sequence-shuffling-revisited/

http://cs.marlboro.edu/ courses/ fall2011/ai/ notes/ sep_20
last modified Tuesday September 20 2011 1:10 pm EDT

attachments

name last modified size