Skip to content
ml-recall

#opponent-model

1 question from Search & Planning

Timed test

1 question · 1 min · score and explanations at the end

Take a test
Q 1 / 1Score 0 / 0

Question 1: Single choice

mediumAI-checkedSearch & Planning

A minimax agent assumes its opponent plays optimally (with respect to the heuristic and a tree of limited depth). In the competition it mostly meets weak opponents that often pick poor moves. What should you expect?

Choose one option