3 Feb 2005
CS 3243 - Game playing
15
Properties of α-β
nPruning does
not affect final result
nGood move ordering improves effectiveness of
pruning
nWith “perfect ordering”, time complexity = O(bm/2)
à doubles
depth of search
nWhat’s the worse and average case time complexity?
nDoes it make sense then to have good heuristics for
which nodes to expand
first?
nA simple example of the value of reasoning about which computations are relevant (a form of metareasoning)
