# NPTEL An Introduction to Artificial Intelligence Assignment 5 Answers 2022

Are you looking for the Answers to NPTEL An Introduction to Artificial Intelligence Assignment 5 – IIT Delhi? This article will help you with the answer to the National Programme on Technology Enhanced Learning (NPTEL) Course “NPTEL An Introduction to Artificial Intelligence Assignment 5

## What is An Introduction to Artificial Intelligence?

An Introduction to Artificial Intelligence by IIT Delhi course introduces the variety of concepts in the field of artificial intelligence. It discusses the philosophy of AI, and how to model a new problem as an AI problem. It describes a variety of models such as search, logic, Bayes nets, and MDPs, which can be used to model a new problem. It also teaches many first algorithms to solve each formulation. The course prepares a student to take a variety of focused, advanced courses in various subfields of AI.

## CRITERIA TO GET A CERTIFICATE

Average assignment score = 25% of the average of best 8 assignments out of the total 12 assignments given in the course.
Exam score = 75% of the proctored certification exam score out of 100

Final score = Average assignment score + Exam score

YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF THE AVERAGE ASSIGNMENT SCORE >=10/25 AND EXAM SCORE >= 30/75. If one of the 2 criteria is not met, you will not get the certificate even if the Final score >= 40/100.

Below you can find the answers for NPTEL An Introduction to Artificial Intelligence Assignment 5

## NPTEL An Introduction to Artificial Intelligence Assignment 5 Answers:-

Q1. Which of the following is/are true about the minimax algorithm with alpha-beta pruning? Assume a 2-player game where the only outcomes are win, loss or draw. An algorithm is called complete when, if there is a way for the player to win, then the algorithm will find it. The notion of optimality is that it must find the sequence of the least number of moves which guarantees a win.

A big Thanks to Shwetanshu For helping us

For Proof: Click Me

Q2. The famous AlphaGo program defeated one of the best Go players, Lee Sedol 4-1. What key algorithms did AlphaGo use?

I give you a minimax search tree with root node A which is a MAX node. Now, A has three children A1,A2 and A3. Also each Ai has three children Ai1, Ai2 and Ai3 (1 <= i <= 3). Now, suppose that the minimax tree computes the backed up values of the nodes to be ????ij = 3|???? − 2| + ????3???? where |.| represents the absolute value. Now, I wish to perform an alpha-beta pruning. Answer the following questions in order to achieve maximum possible pruning.

Q3. What is the ideal order for A1, A2 and A3 for maximum possible pruning ? (If you think A1 should come first followed by A2 and then A3, then write A1A2A3 without any spaces) Note: If two solutions are equally good then pick the lexicographically largest one.

Q4. Assume the ideal ordering of the previous question. Let the number of children of A2 which were explored be e and the number of children which were pruned out be p. Then what is the value of e3 + p?

???? Next Week Answers: Assignment 06 ????

Q5. How many nodes would be pruned out? Assume we explore the nodes in lexicographical order. Pruned out node means that the node was never explored.

Q6. What is the final minimax value which is backed up to root node A?

Q7. In what situations would minimax search not be the best algorithm in an adversarial game?

Q8. Assume that someone gives me a hint that the value backed up at the root of a minimax tree is between 1 and 5. Can I use this information to my advantage?

Q9. Consider a game where it is known that the value of a leaf can only be an integer between 1 and 5 (inclusive). In such a case, consider the following game tree:

Q10. If you think carefully, alpha beta pruning is possible in the previous question. In the best case, what is the least number of min nodes that need to be fully evaluated?