ARTIFICIAL INTELLIGENCE

Our online Tutors are available 24*7 to provide Help with Artificial Intelligence Homework/Assignment or a long term Graduate/Undergraduate Artificial Intelligence Project. Our Tutors being experienced and proficient in Artificial Intelligence ensure to provide high quality Artificial Intelligence Homework Help. Upload your Artificial Intelligence Assignment at Submit Your Assignment button or email it to info@assignmentpedia.com. You can use our Live Chat option to schedule an Online Tutoring session with our Artificial Intelligence Tutors.

Game Playing

(a) UsetheMinimaxalgorithmtocomputetheminimaxvalueat each node for the game tree below. 4 max

-11

min

-11

max

-15

-11

-12

-6

-13

min

14

-15 -5

-11 -12

10 14

-6

-13

(b) UseAlpha-BetaPruningtocomputetheminimaxvalueateach node for the game tree below, assuming children are visited left to right. Show the alpha and beta values at each node. Show which branches are pruned.

max

13,

min

, 13

13,

13, 2

max

14, , 13 pruned

13,

12,

13, 2

0, 2

min

-14 -5

-13 15

15

-12

-1

15 11

10

13

Figure 1: Upon Arrival

2,

max

, 13

13, 2

min

13,

13, 13

2,

2, 2

max

, 14 14, 13 , 13 pruned 13, 12 12, 2

13, 0

0, 2

min

-14 -5

-13 15

15

-12

-1

15 11

10

13

Figure 2: Upon Departure

A
A
8 3 7 2 10 3 5 1

E
1

(a) Inthegureabove,letAbethestartstateandEbethegoal state. The weights on the edges reect the cost to traverse them. Show the ordered contents of the open and closed queues for each stage of the A algorithm. The heuristic function values are given by the table below. node h(n) A 10 B 3 C 9 D 5 E 0 F 1 G 1

The following shows the state of the queues after each round. The queue objects are in the form XY (z ) where X is the node identity, Y is the preceding node in the path under consideration to reach X , and z is the value f (z ) = g (z ) + h(z ) where h is given above and g is the cost of the path being considered that leads to X .

Open {A(10)} {BA (11), DA (14)} {DA (14), EB (15), CB (20)} {FD (13), EB (15), CB (20)} {GF (14), EB (15), CB (20)} {EG (14), CB (20)}

Closed {} {A(10)} {A(10), BA (11)} {A(10), BA (11), DA (14)} {A(10), BA (11), DA (14), FD (13)} {A(10), BA (11), DA (14), FD (13), GF (14)}

After this round, EG is pulled o the queue and the algorithm ends. Following backpointers will yield the path ADF GE . 3

(b) Whatpathisproducedbyrunningthebestrstgreedyalgorithm? ABE This can be seen by repeating the above algorithm but using f = h to compute the z value.

Open {A(10)} {BA (3), DA (5)} {EB (0), DA (5), CB (9)}

Closed {} {A(10)} {A(10), BA (3)}

Simulated Annealing

f (x) = max{(4 |x|, 2 |x 6|, 2 |x + 6|}. It has three peaks with one forming a unique global maximum. Perform 8 rounds of simulated annealing using 4 as your start point, letting the temperature decrease by a factor of 0.9 each round. A point x has four successors: {x + 2, x + 1, x 1, x 2}. Show all of your work, including the current point, the successor chosen, the round temperature, and the probability of changing position given the successor and the temperature. Answers will respect the following constraints. 1. 0 i 7 2. Xi+1 {Xi , Yi } 3. |Yi Xi | {1, 2} 4. Ti = 2(0.9)i 5. Pi {1, e1/Ti , e2/Ti } 6. Pi = min{1, e(f (Yi )f (Xi ))/Ti } 7. F (Yi ) f (Xi ) Xi+1 = Yi , Pi = 1 This can also be interpreted using the following table. Note that here we assume an initial temperature of 2. As this was not specied in the original assignment wording, it will not be enforced during grading. 4

i 0 1 2 3 4 5 6 7 8

Xi 4 {X0 , Y0 } {X1 , Y1 } {X2 , Y2 } {X3 , Y3 } {X4 , Y4 } {X5 , Y5 } {X6 , Y6 } {X7 , Y7 }

Yi Y0 Y1 Y2 Y3 Y4 Y5 Y6 Y7

Ti 2.0000 1.8000 1.6200 1.4580 1.3122 1.1810 1.0629 0.9566

Pi {1} {1, 0.3292, 0.5738} {1, 0.2910, 0.5394} {1, 0.2537, 0.5037} {1, 0.2178, 0.4667} {1, 0.1839, 0.4288} {1, 0.1523, 0.3903} {1, 0.1236, 0.3516}

My sample run through the algorithm produced the following answer. i 0 1 2 3 4 5 6 7 8 Xi 4 3 5 3 4 5 6 6 6 Yi 3 5 3 4 5 6 7 5 Ti 2.0000 1.8000 1.6200 1.4580 1.3122 1.1810 1.0629 0.9566 Pi 1 1 1 0.5037 1 1 0.3903 0.3516 move? yes yes yes yes yes yes no no

This particular run converged to the local maximum at 6.

visit us at www.assignmentpedia.com or email us at info@assignmentpedia.com or call us at +1 520 8371215