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

Discussion

Three of the following improve the efficiency of a search without changing its result. Which is the odd one out?

Forward pruning of unpromising moves

Alpha beta pruning

Transposition tables

Killer move ordering

  • A.Killer move ordering
  • B.Forward pruning of unpromising moves
  • C.Alpha beta pruning
  • D.Transposition tables

Answer: B

Alpha beta, transposition tables and move ordering all reduce the work while returning exactly the value a full search would give. Forward pruning discards branches on suspicion and can therefore discard the best move. The distinction between provably safe and merely plausible pruning is the most important one in this area, since only the first can be adopted without qualification.

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

Post your comment

Please log in or register to post a comment.