Scribd
Upload
60 views3 pages

Alpha-Beta Pruning & A* Algorithm Q&A

The document contains questions related to Alpha-Beta pruning and the A* algorithm in the context of artificial intelligence. It includes tasks such as finding the most cost-effective path using the A* algorithm and exploring game trees with alpha-beta pruning. Additionally, it requires demonstrating the workings of a two-player search tree.

Uploaded by

amit Ji
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
60 views3 pages

Alpha-Beta Pruning & A* Algorithm Q&A

The document contains questions related to Alpha-Beta pruning and the A* algorithm in the context of artificial intelligence. It includes tasks such as finding the most cost-effective path using the A* algorithm and exploring game trees with alpha-beta pruning. Additionally, it requires demonstrating the workings of a two-player search tree.

Uploaded by

amit Ji
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

lOMoARcPSD|52021650

Alpha beta pruning and A* Algorithm Questions

Artificial Intelligence (SRM Institute of Science and Technology)

Scan to open on Studocu

Studocu is not sponsored or endorsed by any college or university


Downloaded by THE HELPER (srmpyqs@[Link])
lOMoARcPSD|52021650

1. Consider the following graph.

The numbers written on edges represent the distance between the nodes. The numbers
written on nodes represent the heuristic value. Find the most cost-effective path to reach
from start state A to Þnal state J using A* Algorithm.

2. Consider the game tree picture below where A-F represents, some real
values. Assume the nodes are explored from left to right and standard alpha beta pruning
is used.

a) Give a value of A such that B is pruned


b) Give a value of A such that B is not pruned
c) Assume B= 5; A = 5 give value of C and D, such that subtree containing E and C is
pruned.

Downloaded by THE HELPER (srmpyqs@[Link])


lOMoARcPSD|52021650

3. Demonstrate the two-player search tree to understand the working of the Alpha-Beta
Pruning.

Downloaded by THE HELPER (srmpyqs@[Link])

You might also like