Machine-translated by Google. Questions are authored in English.
Top

Discussion

What does the maximising player do at their node?

  • A.Choose the successor with the highest backed up value
  • B.Choose the successor with the very lowest backed up value
  • C.Average the values of all the available successors
  • D.Choose a successor at random from the legal moves

Answer: A

The maximiser selects the move giving the largest value, the minimiser the smallest, and the alternation of these two operations up the tree is the whole of minimax. Averaging belongs to chance nodes and random choice to a weak player. Describing the algorithm as two alternating operations on a tree, rather than as a procedure, makes both its correctness and its extensions to chance and to multiple players immediately visible.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.