Move ordering Heuristics
In practice we need quick and dirty heuristics
will neither be optimal nor pessimal
E.g. order moves by static evaluation function
- if it’s reasonable, most promising likely to give good score
- should be nearer optimal than random
If static evaluation function is expensive
- need even quicker heuristics
In practice move ordering heuristics vital