ml-recall

#aspiration-window

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

Shuffle questions

Question 1: Short answer

hardAI-checkedMulti-Agent Systems

Run alpha-beta on the game tree below (MAX at a, children left to right), using the standard rules: a MAX node returns as soon as its value $v \ge \beta$ , a MIN node as soon as $v \le \alpha$ . Instead of $(-\infty, +\infty)$ , start the root with the window $\alpha = 2$ , $\beta = 7$ . How many leaves are statically evaluated?

Game tree: a (MAX) has children b, c, d (MIN). b: e=2, f=6, g. c: h, i=8. d: j=2, k. g (MAX): m=4, n=5. h (MAX): o=1, p=3. k (MAX): q=9, r=1.

Enter: check / next