In the figure, [] and () indicate that it is the MAX and MIN player\'s turn, res
ID: 3712902 • Letter: I
Question
In the figure, [] and () indicate that it is the MAX and MIN player's turn, respectively, and the numbers at the bottom show the payoff for the given terminal positions. Which State MAX will move to using the mini-max and alpha-beta algorithms?
[ ]
/
(A) (B)
/ /
[C] [D] [E] [F]
0 2 -2 4
b) Hill climbing with random restarts is guaranteed to find the global optimum if it runs long enough on a finite state space.T or F
c) Which of the following are used in typical chess programs such as Deep Blue?
a.
alpha-beta pruning
b.
forward chaining
c.
genetic algorithms
d.
trueth tables
d) A and B are propositions. Given the equality P(A|B) = x and the following statements. (~A means negation A)
(i) P(B ->A) = x
(ii) B ->P(A) = x
(iii) P(A| ~B) = 1 -x
(iv) P(~A|B) = 1-x
Which of the above statements are necessarily true?
a.
only (i) and (ii)
b.
only (i) and (iii)
c.
only (iv)
d.
only (ii) and (iv)
a.
alpha-beta pruning
b.
forward chaining
c.
genetic algorithms
d.
trueth tables
Explanation / Answer
a)According to Min-Max algorithm used in Artificial intelligence, State [d] will be moving to use that particular algorithm.
b)Absolutely True as you see Hill climbing will be at the same poition whereas random restart will take global optimum.
c) Alpha-beta pruning will be used in typical chess programs such as deep blue.
d)option b is the answer as given P(A/B)=x...hence P(B->A) will be x and P(A/-B)=1-x
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.