Skip to content
ml-recall

#best-case

1 question from Multi-Agent Systems

Timed test

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

Take a test
Q 1 / 1Score 0 / 0

Question 1: Short answer

hardAI-checkedMulti-Agent Systems

A uniform game tree has branching factor b=3b = 3 and depth d=4d = 4 (81 leaves). If the children are ordered perfectly (best move first everywhere), how many leaves does alpha-beta statically evaluate?

a whole number