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

Discussion

What was later seen as the limitation of chess as a research problem?

  • A.No program was ever able to defeat a strong human player
  • B.The game required more computing power than was available
  • C.Success there did not transfer to messier real world tasks
  • D.The rules of chess proved too complicated to encode correctly

Answer: C

Programs that reached world championship strength did so with search and evaluation techniques that transferred poorly to perception, language and physical action, so the milestone proved less significant than had been hoped. The rules were easy, the milestone was reached, and hardware sufficed. A benchmark whose solution does not generalise is a recurring disappointment in this field, and it is why benchmark choice attracts so much scrutiny.

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

Post your comment

Please log in or register to post a comment.