Skip to content
ml-recall

#move-ordering

2 questions from Multi-Agent Systems

Timed test

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

Take a test
Q 1 / 2Score 0 / 0

Question 1: Short answer

mediumAI-checkedMulti-Agent Systems

A MAX root has three moves L, M, R, each leading to a MIN node with two leaves (values for MAX): L → (2, 3), M → (1, 2), R → (4, 6). Run alpha-beta, but examine every node's children from right to left (R first, and the right leaf of each MIN node first). How many leaves are never examined?

a whole number