#adversarial-search

2 questions from Search & Planning

Timed test

2 questions · 2 min · score and explanations at the end

Q 1 / 2Score 0 / 0

Shuffle questions

Question 1: Single choice

easyAI-checkedSearch & Planning

A minimax agent looks two moves ahead: its own move, then the opponent's reply. The heuristic scores of the resulting boards are:

Agent's move	Scores after each possible reply
1	30, −20, 5
2	4, 16
3	5, 9, 8

Which move does the agent select?

Move 3, because its worst-case score, 5, is the highest of the three1
Move 1, because it is the only move that can reach the top score of 302
Move 2, because its average score, 10, is the highest of the three3
Move 1, because its lowest score is the smallest and minimax minimizes4

Keys: 1–9 select · Enter check / next