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

Discussion

What is a forced move in a game search?

  • A.A move that the opponent can predict with certainty
  • B.A position in which only one legal move exists
  • C.A move the evaluation function scores far above the others
  • D.A move required by an agreement between the players

Answer: B

Where only one move is legal, no branching occurs and the search can extend an extra ply for free, which is one of the standard selective extensions. Sequences of checks often contain several. Strong evaluations, agreements and predictability are different notions. Recognising that a position costs nothing to search deeper, and taking advantage of it, is a small optimisation that follows directly from the structure of the tree.

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

Post your comment

Please log in or register to post a comment.