Scribd
Upload
36 views2 pages

School of Computer Science & Engineering Digital Assignment - I Fall 2021-22 Slot: C2

This document contains instructions for a digital assignment in Artificial Intelligence for the Fall 2021-22 semester. It includes two questions - [1] using the A* algorithm to find the optimal path between a start node S and two goal nodes in a given graph, and explaining how the algorithm can or cannot find both optimal solutions, and [2] discussing whether alpha-beta pruning can safely and effectively be used in a chess program to achieve the best solution space despite the risk of pruning moves that could lead to checkmate or material/tactical advantages in further moves. Students are asked to handwrite their answers and submit a soft copy.

Uploaded by

Majety S Lskshmi
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
36 views2 pages

School of Computer Science & Engineering Digital Assignment - I Fall 2021-22 Slot: C2

This document contains instructions for a digital assignment in Artificial Intelligence for the Fall 2021-22 semester. It includes two questions - [1] using the A* algorithm to find the optimal path between a start node S and two goal nodes in a given graph, and explaining how the algorithm can or cannot find both optimal solutions, and [2] discussing whether alpha-beta pruning can safely and effectively be used in a chess program to achieve the best solution space despite the risk of pruning moves that could lead to checkmate or material/tactical advantages in further moves. Students are asked to handwrite their answers and submit a soft copy.

Uploaded by

Majety S Lskshmi
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
You are on page 1/ 2

SCHOOL OF COMPUTER SCIENCE & ENGINEERING

Digital Assignment - I Fall 2021-22 Slot : C2


Course: CSE3013 – Artificial Intelligence

Faculty : Dr.S.ANTO

Question 1:
Using A* Algorithm , find the optimal path from the node S for the graph given in the
diagram .Two goal nodes are given in the diagram . Explain how the algorithm
can/cannot find the optimal solution for both goal nodes.
Question 2:

If a program prunes away a move in chess that looks bad because it sacrifices valuable
material that may just be the sacrificial move that would have checkmated the opponent
in another few additional ply (or just gain a material and/or tactical advantage)? How
can alpha-beta pruning be made safe for a chess program? Discuss whether this pruning
algorithm can be used to achieve the best solution space for the given problem.

Note : The answers should be handwritten and soft copy to be uploaded in Vtop

You might also like