
Next: Static Board Evaluator (Evaluation
Previous: Examples
 Complete, if tree is finite
 Optimal, if play against optimal opponent (or opponent with same strategy)
 Time complexity is
 Space complexity is (depthfirst exploration)
 If we have 100 seconds to make a move and we can
explore nodes/second, then we can consider nodes per move
Standard approach is
 Apply a cutoff test (depth limit, quiescence)
 Evaluate nodes at cutoff (evaluation function estimates desirability
of position)

