Given position on chess board, decide on best move. Write down a
tree
and expand several ``plies'' (two plies---one by a white, and
one by block make a move). Assign values to final position. Chosen
move is one that leads to highest (best) value of worst possible
scenario---minimax problem.
and expand several ``plies'' (two plies---one by a white, and
one by block make a move). Assign values to final position. Chosen
move is one that leads to highest (best) value of worst possible
scenario---minimax problem.