Properties of α-β
	n Pruning does not affect final result n Good move ordering improves effectiveness of pruning n With “perfect ordering”, time complexity = O(bm/2)  doubles depth of search n What’s the worse and average case time complexity? n Does it make sense then to have good heuristics for which nodes to expand first? n A simple example of the value of reasoning about which computations are relevant (a form of metareasoning)