AI Homework 3
Hide Assignment Information
Instructions
Adversarial Search
Copyright By PowCoder代写 加微信 powcoder
As in class, assume low to high lexicographical node evaluation, so b, b1, b1a is the initial path
searched etc.
Using the attached example tree with terminal score in range [-30, 30]:
1. [3 pts.] Assuming the root player is max, using variables as shown in class, write out the
minimax solution for this tree; e.g. x1=max(2, -19, 8); b = min(b1, b2, b3); etc
2. [2 pts.] Which branch should the max player take from root?
3. [2 pts.] Which branch should the min player take from root?
4. [3 pts.] Assuming the root player is max, using alpha-beta pruning which nodes will be
pruned. This includes nodes partially visited but then pruned.
Just a list. order does not matter.
程序代写 CS代考 加微信: powcoder QQ: 1823890830 Email: powcoder@163.com