Reminder
We consider 2 player perfect information games
Two players, Min and M?x
Leaf nodes given definite score
backing up by MiniMax defines score for all nodes
Usually can’t search whole tree
Use static evaluation function instead
MiniMax hopelessly inefficient
Previous slide
Next slide
Back to first slide
View graphic version