Minimax Evaluation

We could play in hill-climbing fashion by making the move with the highest static value; but this produces weak play by failing to take the future into account.

A better way is to search to a depth bound, evaluate positions statically at the bound, and ``back up'' the values to the top using the minimax algorithm:

Contents    Page-10    Prev    Next    Page+10    Index