artificial intelligence search methods for problem solving nptel assignment answers 2021

• Amazon Quiz
• Flipkart Quiz
• Play & Win 50,000 Coins
• Privacy Policy

Artificial Intelligence Search Methods For Problem Solving 2021

• by QuizXp Team
• July 27, 2021 October 20, 2021

NPTEL Artificial Intelligence Search Methods For Problem Solving the course aims to be successful, an autonomous agent should be able to move from a given situation or state of affairs to arrive at decisions that will transform one’s current situation into a desired goal-state. With the capacity to imagine the consequences of its decisions and actions, a robot can learn how to identify what works best in its environment versus what does not respond well towards the goal being sought after by an agent.

Artificial Intelligence Search Methods For Problem Solving is a MOOC course offered by IIT Madras on the NPTEL platform. This course helps the students to go into the details of how an agent can represent its world and reason with what it knows. The course is developed By Prof. Deepak Khemani is Professor at the Department of Computer Science and Engineering, IIT Madras.

• INTENDED AUDIENCE: UG/PG students who are interested in AI
• Requirements/Prerequisites:  Nil
• INDUSTRY SUPPORT:  Any industry

CRITERIA TO GET A CERTIFICATE

Average assignment score = 25% of the average of the 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

Students will be eligible for CERTIFICATE ONLY IF AVERAGE ASSIGNMENT SCORE >=10/25 AND EXAM SCORE >= 30/75. If any of the 2 criteria are not met, the student will not get the certificate even if the Final score >= 40/100.

NPTEL Artificial Intelligence Search Methods For Problem Solving ASSIGNMENT WEEK 12 ANSWERS:-

Q1. To model a problem as a CSP one has to __________________ .

Answer:- ab

Q2. A constraint on a subset of the variables __________________ .

Answer:- bd

Q3. Which of the following statements are true regarding solving a CSP?

Q4. When a set of statements in Propositional Logic is seen as a CSP then __________________ .

Answer:- ad

Q5. When a set of statements in Propositional Logic is viewed as a CSP then __________________ .

Q6. While modeling components for the task of model based diagnosis, each component is modeled as _________

Q7. The goal of constraint propagation or consistency enforcement is __________________ .

Q8. Does the above puzzle have a unique solution?

Q9. Is the value for the letter G unique for the above puzzle? If your answer is yes, then enter the value below, otherwise enter NIL.

Q10. Is more than one value possible for the letter J (in different solutions of course)?

Q11. What can one say about the value for the letter D?

Q12. What can one say about the value for the letter O?

Q13. For the above CSP the value of D x after the network is made arc consistent is _________ .

Answer:- 3,4,5

Q14. For the above CSP the value of D y after the network is made arc consistent is _________ .

Answer:- 3,4

Q15. For the above CSP the value of D Z after the network is made arc consistent is _________ .

Q16. The algorithm will next assign a value to the variable _________ .

Q17. What is the value that the algorithm will assign to the above variable?

Q18. What are the values in the domain D D of region D at this point (after the variable in question 17 was  assigned a value)? 

Q19. What are the values in the domain D E of region E at this point (after the variable in question 17 was assigned a value)?

Answer:- r,b

Q20. What are the values in the domain D F of region F at this point (after the variable in question 17 was assigned a value)?

Answer:- r,b,g

NPTEL Artificial Intelligence Search Methods For Problem Solving ASSIGNMENT WEEK 11 ANSWERS:-

Q1. An agent who creates a representation of its domain, needs to have the ability to reason because ____________ .

Answer: a, b,c,d

Q2. Given a knowledge base KB of true statements, entailment is concerned with ____________ .

Q3. A rule of inference ____________ .

Answer:- b ,d

Q4. An algorithm for making inferences is a procedure to add new statements using rules of inference. The algorithm is ____________ .

Answer:- a,d

Q5. Modified Modus Ponens ____________ .

Q6. Automated theorem proving is a search algorithm ____________ .

Q7. Identify the true statements.

Answer:- a,e

Q8. Given a KB and a proof procedure, ____________ .

Q9. Let P stand for “path is empty” and Q for “count is different” and ¬Q for “count is same”. Are the statements A and B, given below, equivalent? If yes, then identify the equivalence formula, or else, mark the last option.

Q10. Select the valid entailments.

Answer:- a,c

Q11. Which of the following variable substitutions (Θ) will make the following two formulas equal.

Q12. Consider a knowledge base with three statements:

Answer:- a,c,d ,e

Q13. Identify the rules that participate in the MoveGen function for Forward Chaining. Against each rule write the number of instances of that rule that form the MoveGen with the above facts.

Answer:- 2,0,1,0

Q14. If the,, Forward Chaining algorithm runs till no more inferences are made, which of the following facts will be added to ,the KB?

Answer:- a,b,e

Q15. If the Goal is CanVisit(?X, concert) then which of the rules (A,B,C,D) will be part of the MoveGen in Backward Chaining? That is, what are the relevant rules that generate subgoals, and how many instances of those rules will find a place in the search tree rooted at the goal? Against each rule write the number of instances that will be in the MoveGen.

Answer:- 5,2,3,0

Q16. If the Goal is CanVisit(?X, concert) which of the following goals will be reported as true by Backward Chaining?

Answer:- a,b

Q17. Which of the following queries/goals result in an answer “True” by a theorem prover in the Forward Chaining Mode?

Answer:- a,b,c,d

Q18. Which of the following queries/goals result in an answer “True” by a theorem prover in the Backward Chaining Mode?

Q19. Which of the following queries/goals result in an answer “True” by a theorem prover in the Forward Chaining Mode?

Q20. Which of the following queries/goals result in an answer “True” by a theorem prover in the Backward Chaining Mode?

NPTEL Artificial Intelligence Search Methods For Problem Solving ASSIGNMENT WEEK 10 ANSWERS:-

Q1. Select the options that relate to Production Systems.

Answer:- b,d,g,f

Q2. In a Production System, knowledge is stored as a ________ .

Q3. Conflict resolution ____________

Q4. In a Match-Resolve-Execute cycle ______________

Answer:- b,e

Q5. When a WME enters a Rete Net ______________.

Q6. When the production system is in flight, after the first two rounds of firings, the newly created WME (timestamp 103) is _________ .

Q7. When the production system is in flight, after rule-2 is fired for the second time, the newly created WME (timestamp 106) is _________ .

Q8. Now, the production system has halted. In total, rule-1 was fired _______ times. Your answer must be a whole number.

Q9. Now, the production system has halted. In total, rule-2 was fired _______ times. Your answer must be a whole number.

Q10. How many classes are referred-to in the rule given above? Your answer must be a whole number.

Q11. Which of the following Rule-WME tuples will be present in the conflict set?

Answer:- b,c,d

Q12. How many WMEs will be present in the WM after 2 cycles of execution? Your answer must be a whole number.

Q13. The location of WME 201 is _________ . Enter the label of the alpha nodes as a comma separated list in NUMERICAL ASCENDING order. Or enter Nil.

Answer:- A9

Q14. The location of WME 203 is _ .

Answer:- A18,A19

Q15. The location of WME 211 is _________ . Enter the label of the alpha nodes as a comma separated list in NUMERICAL ASCENDING order. Or enter Nil.

Answer:- Nil

Q16. The number of instances of R6 in the conflict set is _________ . Enter the count, or the number 0 if the rule is not in the conflict set.

Q17. The number of instances of R4 in the conflict set is _________ . Enter the count, or the number 0 if the rule is not in the conflict set

Q18. The number of instances of R2 in the conflict set is _________ . Enter the count, or the number 0 if the rule is not in the conflict set.

Q19. If the inference engine uses Specificity as the conflict resolution strategy then identify the rule-data tuples that will be ready to fire. If multiple rule-data tuples qualify then choose the rule Ri with the smallest index i. Your answer must be a comma separated list starting with a rule label followed by the

Q20. If the inference engine uses Recency as the conflict resolution strategy then identify the rule-data tuples that will be ready to fire. If multiple rule-data tuples qualify then choose the rule Ri with the smallest index i.

NPTEL Artificial Intelligence Search Methods For Problem Solving ASSIGNMENT WEEK 9 ANSWERS:-

Q1. From the set of actions given below, what are the actions that will be present in the first layer of the planning graph being constructed by algorithm Graphplan?

Answer:- A,H,J(1,8,10)

All the best for the final exam, for extra preparation, take our membership for better score in exam read more here:- Final Exam Membership

Q2. What is the number of actions, not counting the No-op actions, in the plan produced by Graphplan?

Answer:- 13

Q3. What is the makespan of the plan produced by Graphplan?

Q4. Which of the planning algorithms are guaranteed to find an optimal problem in any domain ?

Q5. The term “Means” in the Means-Ends-Analysis (MEA) proposed by Newell and Simon refers to

Q6. The term “Ends” in the Means-Ends-Analysis (MEA) proposed by Newell and Simon refers to

Q7. The term “Analysis” in the Means-Ends-Analysis (MEA) proposed by Newell and Simon refers to

Q8. The main idea behind Means-Ends-Analysis is

Answer:- C,D

Q9. An And-Or graph is a graph where

Answer:- B,C

Q10. The AO* algorithm is most similar to

Q11. The termination criterion for the AO* algorithm is

Q12. Starting with S list the nodes in the order they are expanded by algorithm AO*. Observe that primitive nodes are not expanded. Your answer must be a comma separated list of node names.

Answer:- S,A,E

Q13. List the value of the start node S after every expansion listed above. Your answer must be a comma separated list of numbers.

Answer:- 37,32,28

Q14. What is the cost of the solution found? Your answer must be a number.

Answer:- 28

Q15. Is the solution found by the algorithm the optimal solution?

Q16. Starting with S list the nodes in the order they are expanded by algorithm AO*. Observe that primitive nodes are not expanded. Your answer must be a comma separated list of node names.

Answer:- S,A,D,E

Q17. List the value of the start node S after every expansion listed above. Your answer must be a comma separated list of numbers.

Answer:-41,47,50,55

Q18. What is the cost of the solution found? Your answer must be a number.

Answer:- 55

Q19. Is the solution found by the algorithm the optimal solution?

Q20. Given the heuristic values given in the graph above, on inspection the heuristic function

NPTEL Artificial Intelligence Search Methods For Problem Solving ASSIGNMENT WEEK 8 ANSWERS:-

Q1. Which agent has the shortest optimal plan?

Answer:- b(can be wrong, do it yourself and if wrong correct us)

Q2. What is the length of the above agent’s optimal plan?

Q3. Which agent has the longest optimal plan?

Q4. What is the length of the above agent’s optimal plan?

Q5. Using Forward State Space Planning (FSSP) which of the following could be the first operator considered by Ayesha?

Answer:- b,e,f,g,h

Answer:- b,d,f

Answer:- b,d,g

Answer:- a,c,d

Answer:- b,d

NPTEL Artificial Intelligence Search Methods For Problem Solving ASSIGNMENT WEEK 7 ANSWERS:-

Q1. Game Theory is concerned with _________ .

Answer:- c,d

Q2. The Prisoner’s Dilemma demonstrates that _________ .

Q3. The games studied in this course are _________ .

Answer:- a,b,c,d,f,h

Q4. In the Alpha-Beta algorithm, list the line numbers where alpha-cutoff and beta-cutoff occur, respectively.

Answer:- 11,6

Q5. A strategy for MAX in a two player game tree is a subtree that is chosen as below:

Q6. Four two-player game-trees are shown below with some edges highlighted in bold. Which of these depict a game strategy for the root (MAX)?

Answer:- a,b,c

Q7. What is the outcome (W, L or D) of the game when both players play perfectly?

Q8. Which of the moves P, Q, R, S are best moves for Max?

Q9. Which of the moves P, Q, R, S lead to a draw if both play perfectly after the first move?

Q10. What is the MinMax value of the game?

Answer:- 68

Q11. List the nodes (node reference numbers) in the best strategy.

Answer:- 3,4,5,6

Q12. Change the eval of one horizon node to get a MiniMax value of 64. Which node will you change and what will be its new eval? Choose the maximum possible eval for the horizon node that you wish to change.

Answer:- 4,64

Q13. Simulate AlphaBeta algorithm on Game Tree 1. What is the number of alpha-cuts and beta-cuts? Note that a single cut may remove a bunch of edges at once.

Answer:- 6,1

Q14. List the horizon nodes pruned by alpha-cuts.

Answer:- 10,12,13,14,15,16,18,20,21,22,23,24

Q15. List the horizon nodes pruned by beta-cuts.

Answer:- 7,8

Q16. What is the total number of strategies in Game Tree 1?

Answer:- 12

Q17. In Game Tree 1, what is the number of initial clusters formed by SSS*?

Q18. List the horizon nodes in the initial clusters formed by SSS*?

Answer:- 1,3,4,5,6,9,11,17,19

Q19. Simulate SSS* algorithm on Game Tree 1. When the h-values are equal then select the leftmost deeper node in the tree to break the tie. What is the total number of horizon nodes moved to SOLVED status by SSS*?

Q20. What are the horizon nodes that are assigned SOLVED status by SSS*? When h-values are equal then select the leftmost deeper node in the tree to break the tie.

NPTEL Artificial Intelligence Search Methods For Problem Solving ASSIGNMENT WEEK 6 ANSWERS:-

Q1. In the city map, which of the following are true?

Q2. Beam Search is used before DCBFS and BSS to find an upper bound U for the solution. Which variations of Beam will do the task of finding U for going from S to G in the graph below?

The figure (repeated from Week 5) shows a map with several locations on a grid where each tile is 10 km x 10 km in size. In this map, S is the start node and G is the goal node, the locations are connected by two-way edges (roads). Each edge has a cost which is the same in both directions.

Q3. Using w=3 in f = g + w h, simulate WA algorithm on the given map. Let S be the first node to be inspected, now list the 4th, 5th and 6th nodes inspected by the algorithm.

Q4. What are the f-values of the 4th, 5th and 6th nodes listed in the previous question?

Q5. For WA* with w=3, what is the path found by the algorithm?

Q6. What is the cost of the path found by WA* algorithm? (Compare 3A* with Best First Search and A* from Week 5 assignment.)

Q7. List the 4th, 8th and 12th nodes inspected by BFHS.

Q8. What are the costs of the 4th, 8th and 12th nodes listed in the previous question?

Q9. List the nodes in OPEN after SMGS has inspected the 4th node, where S is the first node inspected.

Q10. List the nodes in the BOUNDARY after SMGS has inspected the 4th node, where S is the first node inspected.

Q11. List the nodes in the KERNEL after SMGS has inspected the 4th node, where S is the first node inspected.

Q12. List the nodes in OPEN after SMGS has inspected the 8th node, where S is the first node inspected.

Q13. List the nodes in the BOUNDARY after SMGS has inspected the 8th node, where S is the first node inspected.

Q14. List the nodes in the KERNEL after SMGS has inspected the 8th node, where S is the first node inspected.

Q15. List the nodes in OPEN after SMGS has inspected the 12th node, where S is the first node inspected.

Q16. List the nodes in the BOUNDARY after SMGS has inspected the 12th node, where S is the first node inspected.

Q17. List the nodes in the KERNEL after SMGS has inspected the 12th node, where S is the first node inspected.

Q18. What is the path found by Beam Search?

Q19. What is the cost of the path found in the previous question?

Q20. What is the other node in the beam (apart from G) at the point when the algorithm terminates?

NPTEL Artificial Intelligence Search Methods For Problem Solving ASSIGNMENT WEEK 5 ANSWERS:-

Q1. Consider the (not to scale) map of Triangle Country. We can think of this map as a complete graph with hidden edges carrying an infinite (or +LARGE) cost. To avoid clutter the infinite-cost edges are not shown in the map.

Answer:- 108

Q2. What is the actual cost of the optimal tour for the above problem?

Answer:- 296

Q3. The reasons why one needs to underestimate the estimated cost of fully refining a candidate in order to guarantee an optimal solution are:

Q4. In the A* algorithm, the cost and parent pointers of new nodes (nodes not present in OPEN or CLOSED) are updated in _________________ .

Q5. In the A* algorithm, the cost and parent pointers of nodes in OPEN list are updated in _________________ .

Q6. In the A* algorithm, the cost and parent pointes of nodes in CLOSED list are updated in _________________ .

Answer:- S,N,S,A,E

Answer:- 60,70,80,90,100

Answer:- N,A,F,L,U

Answer:- 70,90,100,110,110

Answer:- E,J,N,R,F

Answer:- 210,220,230,230,250

Answer:- S,O,Q,R,V,G

Answer:- 290

Answer:- S,K,H,M,P,G

Answer:- 350

NPTEL Artificial Intelligence Search Methods For Problem Solving ASSIGNMENT WEEK 4 ANSWERS:-

Q1. Consider the influence graph shown below, it depicts a closed ecosystem. Do not impose any more conditions (from nature) on this graph. Work only with the given data. Keep it simple.

Answer:- b,c,d,e

Q2. The idea of using population based methods to solve optimization problems _________ .

Q3. Which of the following are true? Mark all correct answers

Answer:- b,c

Q4. Genetic Algorithms work best when _________ .

Q5. Darwin’s theory of natural selection can be seen as _________ .

Q6. Which one of the following completes the quote from Paul Valery in the context of Genetic Algorithms? “It takes two to invent anything. The one makes up combinations, _________________”

Q7. When Christof Koch said “The most complex object in the known universe” he was referring to _________ .

Q8. What is the role an individual ant plays in the Ant Colony Algorithm?

Q9. Consider chromosomes made of 5-bit binary strings and a fitness function f(a,b,c,d,e) that is a square of (a + 2b + 3c + 4d + 5e) where “abcde” is the chromosome. An initial population is given in the table.

Answer:- 1,1,1,1

Q10. In the previous question, the individual instances selected for crossover are ___________ .

Q11. The single point crossover can be used to solve the TSP problem if the representation is

Q12. For each graph in the figure, produce a tour by traversing only along the given edges.

Answer:- a,B

Q13. Which of the following are valid path representations of the tour?

Answer:- a,c CAN BE WRONG PLEASE DONT COPY BLINDLY

Q14. Which of the following are valid adjacency representations of the tour?

Answer:- b,d CAN BE WRONG PLEASE DONT COPY BLINDLY

Q15. Which of the following are valid ordinal representations of the valid path representations listed in question 13 .

Q16. Path representations of two tours are given below. Generate offsprings using Partially Mapped Crossover between P1 and P2 using the locations from 4 to 8 as the mapping segment.

Answer:- U,X,P,T,Y,Q,Z,V,S,W,R CAN BE WRONG PLEASE DONT COPY BLINDLY

Q17. Path representations of two tours are given below. Generate offsprings using Order Crossover between P1 and P2 and use locations from 4 to 8 as the mapping segment. In the child tour, retain the mapping segment in the middle. For example, C1 = ?,?,?,T,Y,Q,Z,V,?,?,?

Answer:- U,S,Y,W,Q,T,R,P,Z,V,X CAN BE WRONG PLEASE DONT COPY BLINDLY

Q18. Path representations of two tours are given below. Generate offsprings using Cycle Crossover between P1 and P2. Inherit odd cycles from one parent and even cycles from the other parent to create offspring.

Answer:- R,U,V,T,Y,Q,Z,P,S,W,X CAN BE WRONG PLEASE DONT COPY BLINDLY

Q19. Path representations of two tours are given below. Compute the ordinal representations of the parent tours. And use single point crossover (cut right after the 5th location) to generate offsprings.

Answer:- 3,5,3,3,6,2,2,1,1,2 CAN BE WRONG PLEASE DONT COPY BLINDLY

Q20. A single tour of N cities has a ___________ .

Answer:- D CAN BE WRONG PLEASE DONT COPY BLINDLY

NPTEL Artificial Intelligence Search Methods For Problem Solving ASSIGNMENT WEEK 3 ANSWERS:-

Q1. In the map, starting with node S, list the first 7 nodes inspected by Depth First Search (DFS) algorithm. List the nodes in the order they were inspected. If the algorithm terminates early then list the nodes inspected up until termination.

Answer:- S,E,A,B,C,D,I CAN BE WRONG DONT COPY BLINDLY

Q2. In the map, starting with node S, list the first 7 nodes inspected by the Breadth First Search (BFS) algorithm. List the nodes in the order they were inspected. If the algorithm terminates early then list the nodes inspected up until termination.

Answer:- S,E,J,K,O,A,B CAN BE WRONG DONT COPY BLINDLY

Q3. Which node has the largest heuristic value? What is its heuristic value? Remember to use the Manhattan distance.

Answer:- A,220 CAN BE WRONG DONT COPY BLINDLY

Q4. Which node has the smallest non zero heuristic value? What is its heuristic value? When there are multiple nodes with the smallest heuristic value then you may choose any one of those nodes.

Answer:- Y,-30 CAN BE WRONG DONT COPY BLINDLY

Q5. In the map, starting with node S, list the first 7 nodes inspected by the Best First Search algorithm. During inspection if multiple candidate nodes have the same estimated cost then inspect those nodes in alphabetical order.

Answer:- S,K,L,H,M,P,G CAN BE WRONG DONT COPY BLINDLY

Q6. In the map, starting with node S, list the first 7 nodes inspected by Hill Climbing algorithm. During inspection if multiple nodes have the same cost then inspect those nodes in alphabetical order.

Answer:- S,K,L CAN BE WRONG DONT COPY BLINDLY

Q7. For the given map, which of the algorithms finds a path from the start node S to the goal node G?

Answer:- A,B,D CAN BE WRONG DONT COPY BLINDLY

Q8. For the given city map, try and find a TSP tour using only the edges in the map. Choose the correct options below.

Answer:- A,B CAN BE WRONG DONT COPY BLINDLY

Q9. For the given city map, starting from T and using only the given edges and Euclidean distance as the edge cost, construct a TSP tour using the Nearest Neighbour algorithm. Then,

Answer:- 3,4,4,4,2

Answer:- 10010,10100

Q13. Select the correct statements.

Answer:- A,D CAN BE WRONG DONT COPY BLINDLY

NOTE:- THESE MAY BE INCORRECT PLEASE DON’T FOLLOW BLINDLY IF YOU THINK YOU KNOW THE RIGHT ANSWER FEEL FREE TO CORRECT US SHARE YOUR ANSWER ON TELEGRAM.

Q14. Given a finite state space or a finite solution space, which of these algorithms will always find a path/solution if one exists?

Answer:- A,B,C CAN BE WRONG DONT COPY BLINDLY

Q15. Working with the 2-City-Exchange or the 2-Edge-Exchange operator means that:

Answer:- C,D CAN BE WRONG DONT COPY BLINDLY

Q16. The Iterated Hill Climbing algorithm _________ .

Answer:- B,E

NOTE:- THESE MAY BE INCORRECT PLEASE DON’T FOLLOW BLINDLY IF YOU THINK YOU KNOW RIGHT ANSWER FEEL FREE TO CORRECT US SHARE YOUR ANSWER ON TELEGRAM.

Q17. The Hill Climbing algorithm may run into a local optimum because _________.

Answer:- A,B,C

Q18. The Variable Neighbourhood Descent _________.

Answer:- A,B

Q19. Simulated Annealing _________.

Answer:- A,C

Q20. In stochastic local search _________.

Answer:- B,D

NPTEL Artificial Intelligence Search Methods For Problem Solving ASSIGNMENT WEEK 2 ANSWERS:-

Q1. Starting from (0, 5, 3), what is the least number of moves required to reach (4, 4, 0)?

Answer:- 5 CAN BE WRONG DONT COPY BLINDLY

Q2. Starting from (4, 4, 0), what is the least number of moves required to reach (0, 5, 3)?

Answer:- 2 CAN BE WRONG DONT COPY BLINDLY

Note:- WE NEVER PROMOTE COPYING AND We do not claim 100% surety of answers, these answers are based on our sole knowledge and by posting these answers we are just trying to help students to reference, so we urge do you assignment on your own.

Q3. What is the total number of states reachable from (0, 5, 3) via zero, one or more moves?

Answer:- 14 CAN BE WRONG DONT COPY BLINDLY

Q4. Starting from (0, 5, 3), what is the least number of moves required to reach (6, y, z) where y and z can be any values?

Q5. Starting from (0, 5, 3), what is the least number of moves required to measure 4 litres?

Q6. Starting from (0, 5, 3), what is the least number of moves required to measure 1 litre?

Answer:- 3 CAN BE WRONG DONT COPY BLINDLY

Note:- WE NEVER PROMOTE COPYING AND We do not claim 100% surety of answers, these answers are based on our sole knowledge and by posting these answers we are just trying to help students to reference, so we urge do you assignment own your own.

Q7. Starting from (0, 5, 3), what is the least number of moves required to reach (3, 3, 2)?

Q8. Which of the following is true about 6-5-3 water jug puzzle’s Reachable Subspace (see Notes) of the state space?

Q9. Four search trees associated with the above state space are shown below, where the open nodes are white filled and the closed nodes are blue filled. The search trees are shown for the case when the goal test has passed and the algorithm has ended.

Q10. Identify the BFS search tree?

Q11. At the instance when BFS finds G, the CLOSED list is _____ .

Answer:- yet to solve if know answer can drop in telegram group

NPTEL Artificial Intelligence Search Methods For Problem Solving ASSIGNMENT WEEK 1 ANSWERS:-

Q1. ________ is often referred to as the “first programmer”.

Answer:- C – Lady Ada Lovelace

Q2. Who among the following was the first to build a calculating machine?

Answer:- B – Blaise Pascal

Q3. What can you recall about the “Dartmouth conference” discussed in the lectures? Remember that you will get a zero for even one wrong choice.

Answer:- B, C

Q4. Who said the following? – “Thoughts themselves are symbolic representations”

Q5. The “Universal Grammar” is ______________________

Q6.  Can you recall the picture (below) from the lectures? In what context was it used?

Answer:- A- To express the richness,

Q7. The “Logic Theorist” is ____________________

Q8. Which of the following statements is/are true about “Physical Symbol System Hypothesis”?

Q9. _________ was the first general-purpose mobile robot to be able to reason about its own actions.

Answer:- C – SHAKEY

Q10. ELIZA _________

Q11. Which of the following addresses the question whether machines can be intelligent? Tick all correct answers.

Answer:- B,C,D

Q12. As discussed in the lectures, which of the following is/are successfully deployed embodied robots in the current times?

NOTE:- IF THERE IS ANY CHANGE IN ANSWERS OF Artificial Intelligence Search Methods For Problem WILL UPDATE BEFORE LAST DATE AND NOTIFY ON TELEGRAM OR WHATSAPP. SO KINDLY JOIN US, CLICK ON BELOW IMAGE AND JOIN US.

Q13. Which of the following AI agents demonstrated that machines can beat the very best humans at chess?

Answer:- C – Deep Blue

Q14. As discussed in the “Artificial Intelligence: Search Methods for Problem Solving – Prologue”, this course is about

Q15. The motorcycle soon overtook the school bus because it was going very fast. What was going very fast?

Q16. The motorcycle soon overtook the school bus because it was going very slow. What was going very slow?

Q17.  Suresh told Ramesh that he scolded him because he had hit the little dog. Who had hit the little dog?

Q18. Suresh told Ramesh that he scolded him because he had hit the little dog. Who did the scolding?

Q19. Snigdha told Ramesh that she scolded him because she was in a bad mood. Who was in a bad mood?

Q20. The above five questions involve anaphora resolution . For a computer program to answer the above five questions correctly it would

ALSO CHECK:- INTERNSHIP OPPORTUNITIES

• Announcements
• Explore Courses

Artificial Intelligence Search Methods for problem Solving

ABOUT THE COURSE For an autonomous agent to behave in an intelligent manner it must be able to solve problems. This means it should be able to arrive at decisions that transform a given situation into a desired or goal situation. The agent should be able to imagine the consequence of its decisions to be able to identify the ones that work. In this first course on AI we study a wide variety of search methods that agents can employ for problem solving. In a follow up course – AI: Knowledge Representation and Reasoning – we will go into the details of how an agent can represent its world and reason with what it knows. These two courses should lay a strong foundation for artificial intelligence, which the student can build upon. A third short course – AI: Constraint Satisfaction Problems – presents a slightly different formalism for problem solving, one in which the search and reasoning processes mentioned above can operate together.

Important For Certification/Credit Transfer:

Weekly Assignments and Discussion Forum can be accessed ONLY by enrolling here

Scroll down to Enroll

Note:  Content is Free!

All content including discussion forum and assignments, is free

Final Exam (in-person, invigilated, currently conducted in India) is mandatory for Certification and has  INR Rs. 1100 as exam fee

INTENDED AUDIENCE This is a first course on Artificial Intelligence. While the intended audience is both UG and PG students studying Computer Science, in fact anyone comfortable with talking about algorithms should be able to do the course.

INDUSTRY SUPPORT – LIST OF COMPANIES/INDUSTRY THAT WILL RECOGNIZE/VALUE THIS ONLINE COURSE Any industry that is involved in development of AI applications. This not only includes software companies (like Microsoft, Google, and Facebook) but also manufacturing companies like Ford and General Electric, and retail companies like Amazon and Flipkart.

18038 students have enrolled already!!

Deepak Khemani is Professor at Department of Computer Science and Engineering, IIT Madras. He completed his B.Tech. (1980) in Mechanical Engineering, and M.Tech. (1983) and PhD. (1989) in Computer Science from IIT Bombay, and has been with IIT Madras since then. In between he spent a year at Tata Research Development and Design Centre, Pune and another at the then youngest IIT at Mandi. He has had shorter stays at several Computing departments in Europe.

Prof Khemani’s long-term goals are to build articulate problem solving systems using AI that can interact with human beings. His research interests include Memory Based Reasoning, Knowledge Representation and Reasoning, Planning and Constraint Satisfaction, Qualitative Reasoning, and Natural Language Processing.

He completed his B.Tech. (1980) in Mechanical Engineering, and M.Tech. (1983) and PhD. (1989) in Computer Science from IIT Bombay, and has been with IIT Madras since then. In between he spent a year at Tata Research Development and Design Centre, Pune and another at the youngest IIT at Mandi. He has had shorter stays at several Computing departments in Europe.

Prof Khemani’s long-term goals are to build articulate problem solving systems using AI that can interact with human beings. His research interests include Memory Based Reasoning, Knowledge Representation and Reasoning, Planning and Constraint Satisfaction, Qualitative Reasoning and Natural Language Processing.

PRE-REQUISITES Exposure to data structures and programming and an ability to discuss algorithms is the only pre-requisite. COURSE SYLLABUS For an autonomous agent to behave in an intelligent manner it must be able to solve problems. This means it should be able to arrive at decisions that transform a given situation into a desired or goal situation. The agent should be able to imagine the consequence of its decisions to be able to identify the ones that work. In this first course on AI we study a wide variety of search methods that agents can employ for problem solving.  In a follow up course – knowledge representation and reasoning - we will go into the details of how an agent can represent its world and reason with what it knows. 

PRE-REQUISITES Exposure to data structures and programming and an ability to discuss algorithms is the only pre-requisite.

COURSE SYLLABUS Overview and Historical Perspective, Turing Test, Physical Symbol Systems and the scope of Symbolic AI, Agents. State Space Search, Heuristic Search, Solution Space Search, Stochastic Local Search, Population Based Methods. Optimal Solutions, Algorithm A*, Admissibility of A*, Space saving variations of A*. Problem Decomposition, Algorithm AO*, Rule Based Expert Systems, Rete Algorithm. Game Playing: Algorithms Minimax, AlphaBeta, SSS* Planning: Forward/Backward Search, Goal Stack Planning, Sussman’s Anomaly, Plan Space Planning, Algorithm Graphplan. Text Book (Chapters 1-8): Deepak Khemani, A First Course in Artificial Intelligence , McGraw Hill (India), 2013

COURSE LAYOUT

• The exam is optional for a fee.
• Date of Exams :  October 28 (Sunday)
• Time of Exams :  Morning session 9am to 12 noon; Afternoon session: 2pm to 5pm
• Exam for this course will be available in both morning & afternoon sessions.
• Registration url: Announcements will be made when the registration form is open for registrations.
• The online registration form has to be filled and the certification exam fee needs to be paid. More details will be made available when the exam registration form is published.
• Final score will be calculated as : 25% assignment score + 75% final exam score
• 25% assignment score is calculated as 25% of average of  Best 8 out of 12 assignments
• E-Certificate will be given to those who register and write the exam and score greater than or equal to 40% final score. Certificate will have your name, photograph and the score in the final exam with the breakup.It will have the logos of NPTEL and IIT Madras.It will be e-verifiable at  nptel.ac.in/noc .

A project of

In association with

Provide details on what you need help with along with a budget and time limit. Questions are posted anonymously and can be made 100% private.

Studypool matches you to the best tutor to help you with your question. Our tutors are highly qualified and vetted.

Your matched tutor provides personalized help according to your question details. Payment is made only after you have completed your 1-on-1 session and are satisfied with your session.

• Homework Q&A
• Become a Tutor

All Subjects

Mathematics

Programming

Health & Medical

Engineering

Computer Science

Foreign Languages

Access over 35 million academic & study documents

Artificial intelligence assignment nptel.

Sign up to view the full document!

24/7 Study Help

Stuck on a study question? Our verified tutors can answer all questions, from basic  math  to advanced rocket science !

Similar Documents

working on a study question?

Studypool is powered by Microtutoring TM

Copyright © 2024. Studypool Inc.

Studypool is not sponsored or endorsed by any college or university.

Ongoing Conversations

Access over 35 million study documents through the notebank

Get on-demand Q&A study help from verified tutors

Read 1000s of rich book guides covering popular titles

Sign up with Google

Sign up with Facebook

Already have an account? Login

Login with Google

Login with Facebook

Don't have an account? Sign Up

• NPTEL courses
• IIT Workshops
• Partnering courses

Course list

Artificial Intelligence Search Methods for problem Solving

₹ 3,000.00

Prof. Deepak Khemani IIT Madras

*Additional GST and optional Exam fee are applicable.

Description

Additional information, certification process, course details.

• Reviews (1)

INTENDED AUDIENCE

Industry support, about the instructor.

Deepak Khemani is Professor at Department of Computer Science and Engineering, IIT Madras. He completed his B.Tech. (1980) in Mechanical Engineering, and M.Tech. (1983) and PhD. (1989) in Computer Science from IIT Bombay, and has been with IIT Madras since then. In between he spent a year at Tata Research Development and Design Centre, Pune and another at the youngest IIT at Mandi. He has had shorter stays at several Computing departments in Europe. Prof Khemani’s long-term goals are to build articulate problem solving systems using AI that can interact with human beings. His research interests include Memory Based Reasoning, Knowledge Representation and Reasoning, Planning and Constraint Satisfaction, Qualitative Reasoning and Natural Language Processing.

1. Join the course Learners may pay the applicable fees and enrol to a course on offer in the portal and get access to all of its contents including assignments. Validity of enrolment, which includes access to the videos and other learning material and attempting the assignments, will be mentioned on the course. Learner has to complete the assignments and get the minimum required marks to be eligible for the certification exam within this period.

COURSE ENROLMENT FEE: The Fee for Enrolment is Rs. 3000 + GST

2. Watch Videos+Submit Assignments After enrolling, learners can watch lectures and learn and follow it up with attempting/answering the assignments given.

3. Get qualified to register for exams A learner can earn a certificate in the self paced course only by appearing for the online remote proctored exam and to register for this, the learner should get minimum required marks in the assignments as given below:

CRITERIA TO GET A CERTIFICATE Assignment score = Score more than 50% in at least 9/12 assignments. Exam score = 50% of the proctored certification exam score out of 100 Only the e-certificate will be made available. Hard copies will not be dispatched.”

4. Register for exams The certification exam is conducted online with remote proctoring. Once a learner has become eligible to register for the certification exam, they can choose a slot convenient to them from what is available and pay the exam fee. Schedule of available slot dates/timings for these remote-proctored online examinations will be published and made available to the learners.

EXAM FEE: The remote proctoring exam is optional for a fee of Rs.1500 + GST. An additional fee of Rs.1500 will apply for a non-standard time slot.

5. Results and Certification After the exam, based on the certification criteria of the course, results will be declared and learners will be notified of the same. A link to download the e-certificate will be shared with learners who pass the certification exam.

CERTIFICATE TEMPLATE

Week 1 :  Introduction: Philosophy, Mind, Reasoning, Computation, Dartmouth Conference, The Chess Saga, Epiphenomena Week 2 :  State Space Search: Depth First Search, Breadth First Search, Depth First Iterative Deepening Week 3 :  Heuristic Search: Best First Search, Hill Climbing, Solution Space, TSP, Escaping Local Optima, Stochastic Local Search Week 4 :  Population Based Methods: Genetic Algorithms, SAT, TSP, emergent Systems, Ant Colony Optimization Week 5 :  Finding Optimal Paths: Branch & Bound, A*, Admissibility of A*, Informed Heuristic Functions Week 6 :  Space Saving Versions of A*: Weighted A*, IDA*, RBFS, Monotone Condition, Sequence Alignment, DCFS, SMGS, Beam Stack Search Week 7 :  Game Playing: Game Theory, Board Games and Game Trees, Algorithm Minimax, AlphaBeta and SSS* Week 8 :  Automated Planning: Domain Independent Planning, Blocks World, Forward &Backward Search, Goal Stack Planning, Plan Space Planning Week 9 :  Problem Decomposition: Means Ends Analysis, Algorithm Graphplan, Algorithm AO* Week 10 :  Rule Based Expert Systems: Production Systems, Inference Engine, Match-Resolve-Execute, Rete Net Week 11 :  Deduction as Search: Logic, Soundness, Completeness, First Order Logic, Forward Chaining, Backward Chaining Week 12 :  Constraint Processing: CSPs, Consistency Based Diagnosis, Algorithm Backtracking, Arc Consistency, Algorithm Forward Checking

Books and References

1. Deepak Khemani. A First Course in Artificial Intelligence, McGraw Hill Education (India), 2013.

Reference Books:

1. Stefan Edelkamp and Stefan Schroedl. Heuristic Search: Theory and Applications, Morgan Kaufmann, 2011. 2. John Haugeland, Artificial Intelligence: The Very Idea, A Bradford Book, The MIT Press, 1985. 3. Pamela McCorduck, Machines Who Think: A Personal Inquiry into the History and Prospects of Artificial Intelligence, A K Peters/CRC Press; 2 edition, 2004. 4. Zbigniew Michalewicz and David B. Fogel. How to Solve It: Modern Heuristics. Springer; 2nd edition, 2004. 5. Judea Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, 1984. 6. Elaine Rich and Kevin Knight. Artificial Intelligence, Tata McGraw Hill, 1991. 7. Stuart Russell and Peter Norvig. Artificial Intelligence: A Modern Approach, 3rd Edition, Prentice Hall, 2009. 8. Eugene Charniak, Drew McDermott. Introduction to Artificial Intelligence, Addison-Wesley, 1985. 9. Patrick Henry Winston. Artificial Intelligence, Addison-Wesley, 1992.

1 review for Artificial Intelligence Search Methods for problem Solving

Erma Leaird – February 2, 2023

Very good site for my students.

Your review  *

Name  *

Email  *

Save my name, email, and website in this browser for the next time I comment.

• Review Assignment
• Announcements
• About the Course
• Explore Courses

RBCDSAI Teaching Fellowship Program - REGISTER NOW !!

Artificial Intelligence Search Methods For Problem Solving : Thank you for learning with NPTEL!

Dear Learner, Thank you for taking the course with NPTEL!! Hope you enjoyed the journey with us. The results for this course have been published and we are closing this course now.  You will still have access to the contents and assignments of this course, if you click on the course name from the "Mycourses" tab on swayam.gov.in . The discussion forum is being closed though and you cannot ask questions here. For any further queries please write to [email protected] . We are happy to announce that our next set of courses to be offered in Jan 2020 -which is open now for enrollment. Please check the Tentative course list for Jan 2020 in the below link: http://bit.ly/JAN2020-NPTEL -NPTEL Team

Artificial Intelligence Search Methods For Problem Solving : Results for Nov 16 exams have been published

Dear Learner,  The results for  Nov 16,2019  exams have been published.  You will be informed via mail and SMS about the release of exam results and e-certificates.  How to find out if results have been published?  To check the publishing status of exam scores and e-certificates, click on this link:  https://docs.google.com/spreadsheets/d/e/2PACX-1vQ81rBXI69SXTHpf7900CWJRb8mMdort4RmTjYC_XTu1nNZAPBSL22yIBynMlOd3BqXO1ldUFdOXUqT/pubhtml?urp=gmail_link How to check exam results & e-certificates:  If you have taken the exam, your score and e-certificate is now available at  https://nptel.ac.in/noc/ Login with the course enrolled e-mail id.  Clicking on the course name will redirect to the score board.  Click on Exam Scores - Both the Assignment scores and Exam score will be displayed.  Final score is the certification score.  Calculation Logic for each course is provided in the same page.  Reporting of errors  For each course, reporting of issues comes with its own deadline (date and time)  So check the exam score/e-certificate as soon as you receive our notification.  For any queries, please use this  FAQ   http://bit.ly/NOV16-17FAQ If you are unable to see the scores/e-certificates, please write to  [email protected]  - NPTEL TEAM

Feedback For Artificial Intelligence Search Methods For Problem Solving

Artificial intelligence search methods for problem solving : best of luck for your exam .

NPTEL - 16th November 2019 Hall ticket Released !

Links to download the hall ticket / admit card:

Click here to download your hall ticket -  https://results.nptel.ac.in/ sep/

https://cdn3.digialm.com:443// EForms/configuredHtml/885/ 62747/login.html

Please Note:

• The Admit Card must be presented for verification along with one original govt issued photo identification (not photocopy or scanned copy).
• Acceptable photo identification documents are College ID, Employee ID, Driving License, Passport, PAN card, Voter ID, Aadhaar-ID.
• Printed copy of hall ticket and original photo ID card should be brought to the exam centre.
• Hall ticket and ID card copies on the phone will not be permitted.
• Please read the instructions that are given on the hall ticket before coming to the exam.
• Click Here  to view the candidate instructions and code of conduct

On-Screen Calculator Demo Link:

Kindly use the below link to get an idea of how the On-screen calculator will work during the exam.

Change of shift, course, exam center, exam city will not be done. What's mentioned in your Hall-ticket is final.

NPTEL Team wishes you the very best for the certification exam!

Warm Regards, NPTEL Team

AISMPS: Week 9 and Week 12 assignments reevaluated!

Dear all, Reevaluation  of the following questions  has been done: Week 9: Question 14 correct answer:    57,17,60,70,75,77,80, 88   Week 12: Question 13 correct options: a,b,d Please check your scores and revert back if there is any discrepancy.  Regards, TA

Artificial Intelligence Search Methods For Problem Solving : Exam Type and Certificate Format

Dear Candidate, Type of exam: Computer based exam  You will have to appear at the allotted exam center and produce your Hall ticket and Government Photo Identification Card (Example: Driving License, Passport, PAN card, Voter ID, Aadhaar-ID with your Name, date of birth, photograph and signature) for verification and take the exam in person.  You can find the final allotted exam center details in the hall ticket. The questions will be on the computer and the answers will have to be entered on the computer; type of questions may include multiple choice questions, fill in the blanks, essay-type answers, etc. The hall ticket will be available for download tentatively around  Nov 5 - 14, 2019 . We will notify the same through email and SMS. On-Screen Calculator Demo Link: Kindly use the below link to get an idea of how the On-screen calculator will work during the exam. https://tcsion.com/ OnlineAssessment/ ScientificCalculator/ Calculator.html NOTE: Physical calculators are not allowed inside the exam hall.  FINAL CERTIFICATE: The final score = 25% assignment score + 75% final certification exam score. YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF 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. The final score will determine if you will/will not receive a certificate. 1. Final score  < 40%: NO certificate. 2. Final score between  40% -59%:  Certificate of type  "Successfully completing the course". 3. Final score between  60% -74%:  Certificate with tag  "Elite"  printed at the top. 4. Final score between  75% -89%:  Certificate with tag  "Elite" tag and "Silver medal"  printed at the top. 5. Final score of  90% and above : Certificate with  "Elite"  tag and the  "gold medal"  printed on it. -NPTEL Admin

LIVE INTERACTIVE SESSION WITH NPTEL COORDINATORS - OCT 23 (WEDNESDAY) 4:30 pm

Dear candidates,  NPTEL Coordinators would like to address all the candidates about this on-going semester, course run, exams, results, etc.  This LIVE interactive session is meant to clarify any queries you may have.  Please do not ask technical questions about the course content, Assignment, etc. as we will not be able to answer these.  Kindly fill this form with your queries which will be discussed during the LIVE session.  You may ask queries via the chat window during the session.  DAY: OCTOBER 23, 2019 (Wednesday)  TIME: 4:30pm  Link to submit queries/suggestions :  https://forms.gle/AD5tLgGK2oSJxFi98   YouTube Link for Live Session:   https://youtu.be/1xKn1vfnJFk   Thank you. -NPTEL Team.

Artificial Intelligence Search Methods For Problem Solving : Week 12 Feedback

Artificial intelligence search methods for problem solving : week 12 is live now .

Dear students The lecture videos for  Week-12  have been uploaded for the course. The lectures can be accessed using the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=66&lesson=67 The other lectures in this  week  are accessible from the navigation bar to the left. Please remember to login into the website to view contents (if you aren't logged in already).   Assignment for  Week-12  is also uploaded and can be accessed from the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=66&assessment=115 The assignment has to be submitted on or before  Wednesday ,  [23-10-2019 23:59 IST] .   As we have done so far, please use the discussion forums if you have any questions on this module. Note: Please check the due date of the assignments in the announcement and assignment page if you see any mismatch write to us immediately. -NPTEL Team

Artificial Intelligence Search Methods For Problem Solving : Week 11 Feedback

Artificial intelligence search methods for problem solving : week 11 is live now .

Dear students The lecture videos for  Week-11  have been uploaded for the course. The lectures can be accessed using the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=61&lesson=62 The other lectures in this  week  are accessible from the navigation bar to the left. Please remember to login into the website to view contents (if you aren't logged in already).   Assignment for  Week-11  is also uploaded and can be accessed from the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=61&assessment=114 The assignment has to be submitted on or before  Wednesday ,  [16-10-2019 23:59 IST] .   As we have done so far, please use the discussion forums if you have any questions on this module. Note: Please check the due date of the assignments in the announcement and assignment page if you see any mismatch write to us immediately. -NPTEL Team

Artificial Intelligence Search Methods For Problem Solving : LAST REMINDER FOR REGISTERING FOR NOV EXAM - LAST 4 DAYS LEFT!

Dear Learner Exam registration URL is:  https://examform.nptel.ac.in/ Login here using the same email id which you had used to enroll in the course in Swayam portal.  Recommended: Use the Desktop/Laptop with Chrome private browser - incognito window - to access the form.  EXAM FEES: Exam fees will be Rs. 1000/- per exam.  (We are not changing it to Rs 1500/- this time as earlier announced; it will be Rs 1000/- till Oct 7. LAST DATE FOR REGISTERING FOR NOV 16/17 EXAMS: Oct 7, 2019  - 10:00 AM FAQ Request you to kindly check the FAQ that has common issues reported and their solution and follow steps given there to address the issue. Link:  http://bit.ly/ faqjuly2019 PAYMENT RECEIPT: Will be available inside your login after October 10, 2019. HALL TICKETS: Will be available between November 6-10: we will send you emails regarding this. If you still have any queries, please write to  [email protected] .  Thank you for your support and understanding - NPTEL team.

Artificial Intelligence Search Methods For Problem Solving : Week 10 Feedback

Artificial intelligence search methods for problem solving : week 10 is live now .

Dear students The lecture videos for  Week -10  have been uploaded for the course. The lectures can be accessed using the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=56&lesson=57 The other lectures in this  week  are accessible from the navigation bar to the left. Please remember to login into the website to view contents (if you aren't logged in already).   Assignment for  Week -10  is also uploaded and can be accessed from the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=56&assessment=113 The assignment has to be submitted on or before  Wednesday ,  [09-10-2019 23:59 IST] .   As we have done so far, please use the discussion forums if you have any questions on this module. Note: Please check the due date of the assignments in the announcement and assignment page if you see any mismatch write to us immediately. -NPTEL Team

REMINDER for Exam Registration: Artificial Intelligence Search Methods For Problem Solving

• If you are filling up the form the first time, please fill the first 4 pages with care- ensure ALL fields are entered and correct information is given.
• Ensure a good quality photo - in passport size taken in studio is uploaded.
• The signature should be clear and uploaded in horizontal style.
•  Go to the Course Details tab.
•  Delete all courses.
•  Add the courses again.
•  Click on View Cart.
•  Check if details are ok and click on Preview and Checkout.
•  Fill the captcha, read the conditions and proceed to Pay".

Artificial Intelligence Search Methods For Problem Solving: Week 7 assignment reevaluated!

Dear all, The reevaluation of Q16 (as discussed on the forum) is complete. You may check your scores now. Revert back if there is any discrepancy. Thanks. --TA

Artificial Intelligence Search Methods For Problem Solving : Week 9 Feedback

Artificial intelligence search methods for problem solving : week 9 is live now .

Dear students The lecture videos for  Week -9  have been uploaded for the course. The lectures can be accessed using the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=51&lesson=52 The other lectures in this  week  are accessible from the navigation bar to the left. Please remember to login into the website to view contents (if you aren't logged in already).   Assignment for  Week -9  is also uploaded and can be accessed from the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=51&assessment=112 The assignment has to be submitted on or before  Wednesday ,  [02-10-2019 23:59 IST] .   As we have done so far, please use the discussion forums if you have any questions on this module. Note: Please check the due date of the assignments in the announcement and assignment page if you see any mismatch write to us immediately. -NPTEL Team

Artificial Intelligence Search Methods For Problem Solving: Typo in Q12 assignment 8.

Q12. talks about two persons A and B who were involved in a crime but in the options we have S and G. You can replace A with S and B with G .... A is same as S, B is same as G. Thanks. --TA

Artificial Intelligence Search Methods For Problem Solving : Week 8 Feedbck

Artificial intelligence search methods for problem solving: exam form is up - register today.

Dear Learner  Exam form is open now.  New Certification exam registration URL is:   https://examform.nptel.ac.in/   Login here using the same email id which you had used to enroll to the course in Swayam portal.  Exam fees:  • If you register for the exam and pay before  Oct 3, 10:00 AM,  Exam fees will be Rs. 1000/- per exam.   • If you register for the exam before  Oct 3, 10:00 AM and have not paid or if you register between Oct 3, 10:00 AM & Oct 7, 5:00 PM, Exam fees will be Rs. 1500/- per exam.  Registration deadlines are being extended until Oct 7, 2019.  FDP Certificate:  We will publish a separate form for FDP Certificate, please wait for that to hear from us.  IMPORTANT NOTE:   1. For the users registered/paid before 5th September 2019. We have your registration completed with all details captured. We will enable you to check/make payment in a few days, maximum before Sep 24, 2019. So do not worry.  2. Always use chrome browser to log in and register for the exam.  3. Payment Receipts will be available in the login once after the registration is closed. (After Oct 8, 2019)  4. Pay via SPOC is not currently enabled, hence fill the form and submit and contact your college coordinator   5.   Old Exam Registration URL will not work.    In case of queries, please write to   [email protected] .  Thank you for your support and understanding.  - NPTEL team.

Artificial Intelligence Search Methods For Problem Solving: Week 6 assignment reevaluated!

Dear all, The reevaluation of Q3, Q10 and Q14 (as discussed on the forum) is complete. You may check your scores now. Revert back if there is any discrepancy. Thanks. --TA

Artificial Intelligence Search Methods For Problem Solving : Week 8 is live now !!

Dear students The lecture videos for  Week -8  have been uploaded for the course. The lectures can be accessed using the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=46&lesson=47 The other lectures in this  week  are accessible from the navigation bar to the left. Please remember to login into the website to view contents (if you aren't logged in already).   Assignment for  Week -8  is also uploaded and can be accessed from the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=46&assessment=111 The assignment has to be submitted on or before  Wednesday ,  [25-09-2019 23:59 IST] .   As we have done so far, please use the discussion forums if you have any questions on this module. Note: Please check the due date of the assignments in the announcement and assignment page if you see any mismatch write to us immediately. -NPTEL Team

Artificial Intelligence Search Methods For Problem Solving : Week 7 Feedback

Artificial intelligence search methods for problem solving : week 5 reevaluation completed.

In assignment 5, Q17 and Q18 in addition to tour order now allows cycle-order as well (see links given below). The reevaluation is complete. You may check your scores now. For now, use a desktop to check your answers and scores, at the moment the mobile app seems to have refresh issue. See: 1.  Reevaluation: Assignment 5 Q17, Q18 2.  Solved Assignment 5 TSP CROSSOVER Q17 to Q20 -- TA

Artificial Intelligence Search Methods For Problem Solving: Correction in Q8 assignment 6.

Correction in Q8 assignment 6. Q8 is modified as: 8) What is the path found by the Branch and Bound algorithm when it terminates on the graph shown above ? If no path is found please enter ‘NIL’. Original version is: 8) What is the path found by the Branch and Bound algorithm in the previous question ? If no path is found please enter ‘NIL’ -- TA

Artificial Intelligence Search Methods For Problem Solving : Week 7 is live now !!

Dear students The lecture videos for  Week-7  have been uploaded for the course. The lectures can be accessed using the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=41&lesson=42 The other lectures in this week are accessible from the navigation bar to the left. Please remember to login into the website to view contents (if you aren't logged in already).   Assignment for  Week-7  is also uploaded and can be accessed from the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=41&assessment=109 The assignment has to be submitted on or before  Wednesday ,  [18-09-2019 23:59 IST] .   As we have done so far, please use the discussion forums if you have any questions on this module. Note: Please check the due date of the assignments in the announcement and assignment page if you see any mismatch write to us immediately. -NPTEL Team

Artificial Intelligence Search Methods For Problem Solving : Video recording on Interactive session

Dear All, There was an interaction session with some of the students for the course. The video recording is now available in the portal under the last unit "Live session" Those who are interested can take a look. Youtube link :  https://www.youtube.com/watch?v=OzM4DFEdz14 Feedback form:  https://forms.gle/EVSxb2B9J8JbLEm66 -NPTEL Team

Artificial Intelligence Search Methods For Problem Solving : Week 6 is live now !!

Dear students The lecture videos for   Week -6  have been uploaded for the course. The lectures can be accessed using the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=36&lesson=37 The other lectures in this  week  are accessible from the navigation bar to the left. Please remember to login into the website to view contents (if you aren't logged in already).   Assignment for   Week -6  is also uploaded and can be accessed from the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=36&assessment=106 The assignment has to be submitted on or before   Wednesday, [11-09-2019 23:59 IST].   As we have done so far, please use the discussion forums if you have any questions on this module. -NPTEL Team

Artificial Intelligence : Search Methods For Problem solving : Live interaction with Course Instructor

Dear learner  You can interact LIVE with the Course Instructor Prof. Deepak Khemani, IIT Madras of the course – “Artificial Intelligence : Search Methods For Problem solving".  Date: 30.08.2019 Time: 5.00 PM Link to login to:  https://www.youtube.com/watch?v=OzM4DFEdz14 Enter your questions you want Prof. Deepak Khemani to answer at http://bit.ly/2MDkFL0   You can also ask your doubts during the session through the chat window...  We would also like to hear from you after the session. Request you to share your thoughts in the forum. Learners are encouraged to visit bit.ly/NPTELLIVE   for updates on the live sessions.  -NPTEL team

Artificial Intelligence Search Methods For Problem Solving : Week 3 Reevaluation Completed

In assignment 3 (as some of you rightly pointed out) the answers to Q7 and Q8 has been corrected and the reevaluation is complete. You may check your scores now. -- TA

Artificial Intelligence Search Methods For Problem Solving : Week 5 is live now !!

Dear students The lecture videos for   Week -5  have been uploaded for the course. The lectures can be accessed using the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=31&lesson=32 The other lectures in this  week  are accessible from the navigation bar to the left. Please remember to login into the website to view contents (if you aren't logged in already).   Assignment for   Week -5  is also uploaded and can be accessed from the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=31&assessment=105 The assignment has to be submitted on or before   Wednesday, [04-09-2019 23:59 IST].   As we have done so far, please use the discussion forums if you have any questions on this module. Note: Please check the due date of the assignments in the announcement and assignment page if you see any mismatch write to us immediately. -NPTEL Team

Artificial Intelligence Search Methods For Problem Solving : Week 4 is live now !!

Dear students The lecture videos for   Week -4  have been uploaded for the course. The lectures can be accessed using the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=25&lesson=26 The other lectures in this  week  are accessible from the navigation bar to the left. Please remember to login into the website to view contents (if you aren't logged in already).   Assignment for   Week -4  is also uploaded and can be accessed from the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=25&assessment=104 The assignment has to be submitted on or before   Wednesday, [28-08-2019 23:59 IST].   As we have done so far, please use the discussion forums if you have any questions on this module. -NPTEL Team

Artificial Intelligence Search Methods For Problem Solving : Assignment 2 Clarification II

Pay attention to the order in which nodes are returned by MoveGen(X). Pay attention to how nodes are added to OPEN (that uses head-tail format). Pay attention to how nodes are removed from OPEN and added to CLOSED (in head-tail format). These factors influence the visitation order and it is easy to go wrong in the final answer.

OPEN     = ((2,1), (3,1), ...) newPairs  = ((B,A), (C,A), (D,A)) OPEN     = append( newPairs , OPEN) ------------------------------ --------------------- OPEN     = ( (B,A), (C,A), (D,A) , (2,1), (3,1), ...)

OPEN     = ((2,1), (3,1), ...) newPairs = ((B,A), (C,A), (D,A)) OPEN     = append(OPEN,  newPairs ) ------------------------------ --------------------- OPEN     = ((2,1), (3,1), ...,  (B,A), (C,A), (D,A) )

Note that the MoveGen(X) function specifies the order in which neighbours are generated. Also remember that the path found is the one that is reported by the ReconstructPath function that is called by all the search algorithms when the goal node is reached. You may need to revise that.

Q19 adds all neighbour nodes to OPEN,  Q17 does not add those already in CLOSED, and  Q15 does not add those already in OPEN or CLOSED. These examples illustrate the different manner in each of the three algorithms explore the graph,  perhaps with some nodes visited more than once, and maybe finding different paths. -- TA

Artificial Intelligence Search Methods For Problem Solving : Due date for Assignment 2 Extended!

Dear Learners Based on requests received, we are extending the deadline of the assignment 2. Deadline for Assignment 2 has been extended  till August 21, 2019 - 23:59 IST Assignment 1 will close on  14 August 2019  - 23:59 IST ,  as per the original deadline.  - NPTEL Team

Artificial Intelligence Search Methods For Problem Solving : Week 3 is live now !!

Dear students The lecture videos for   Week -3  have been uploaded for the course. The lectures can be accessed using the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=20&lesson=21 The other lectures in this  week  are accessible from the navigation bar to the left. Please remember to login into the website to view contents (if you aren't logged in already).   Assignment for   Week -3  is also uploaded and can be accessed from the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=20&assessment=103 The assignment has to be submitted on or before   Wednesday, [21-08-2019 23:59 IST].   As we have done so far, please use the discussion forums if you have any questions on this module. -NPTEL Team

Week 2 Feedback : Artificial Intelligence Search Methods For Problem Solving

Dear Learner Thank you for continuing with the course and hope you are enjoying it. We would like to know if the expectations with which you joined this course are being met and hence please do take 2 minutes to fill out our weekly feedback form. It would help us tremendously in gauging the learner experience. Here is the link to the form:  https://nptel.ac.in/noc/ nocprofile/super_admin/weekly_ feedback/form_login.php Thank you. -NPTEL team

Artificial Intelligence Search Methods For Problem Solving : Week 2 is live now !!

Dear students The lecture videos for  Week-2  have been uploaded for the course. The lectures can be accessed using the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=15&lesson=16 The other lectures in this week are accessible from the navigation bar to the left. Please remember to login into the website to view contents (if you aren't logged in already).   Assignment for  Week-2  is also uploaded and can be accessed from the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=15&assessment=102 The assignment has to be submitted on or before   Wednesday, [14-08-2019 23:59 IST].   As we have done so far, please use the discussion forums if you have any questions on this module. -NPTEL Team

Artificial Intelligence Search Methods For Problem Solving : Steps to access the assignment through Mobile App

Dear Learners   Assignments have been released for all courses for week 1. If you are using the mobile app, please ensure you see the assignment link. If you don't, please do the following steps:  Step 1:  Go to setting on your android phone  Step 2:  Go to the “Apps” in the settings  Step 3:  You will get a list of apps. Click on Swayam app  Step 4:  You will see app info. Go to the storage in the app info  Step 5:  Click on clear data and clear cache button.  Step 6:  Login again to the SWAYAM app using the credentials used to enroll in the course.  Please note that if the OS version in your Android phone is 6, the content may not show up properly. Kindly refer to the web version to ensure you see all the contents of the week and then proceed to use the app.   -NPTEL Team

Week 1 Feedback : Artificial Intelligence Search Methods For Problem Solving

Dear Learner Thank you for continuing with the course and hope you are enjoying it. We would like to know if the expectations with which you joined this course are being met and hence please do take 2 minutes to fill out our weekly feedback form. It would help us tremendously in gauging the learner experience. Here is the link to the form:  https://nptel.ac.in/noc/nocprofile/super_admin/weekly_feedback/form_login.php Thank you. -NPTEL team

Artificial Intelligence Search Methods For Problem Solving : : Week 1 is live now!!

Dear students The lecture videos for Week-1 have been uploaded for the course. The lectures can be accessed using the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=7&lesson=8 The other lectures in this week are accessible from the navigation bar to the left. Please remember to login into the website to view contents (if you aren't logged in already).   Assignment for Week-1 is also uploaded and can be accessed from the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=7&assessment=100 The assignment has to be submitted on or before Wednesday, [ 14-08-2019 23:59 IST ].   As we have done so far, please use the discussion forums if you have any questions on this module. -NPTEL Team

Welcome to AI: Search Methods for Problem Solving

Artificial Intelligence (AI) can be seen as the quest of building thinking machines. Some practitioners say that AI involves mimicking human intelligence, but I like the definition given by John Haugeland (1945 - 2010) who said that the goal of AI is to build "machines with minds of their own". We begin this course with a history of this quest, which goes back to times much before the digital computer appeared on the scene. We have already uploaded two weeks of videos. This is because in the first week we discuss the history of AI, and the philosophical questions like what is thinking, and can a machine think. Looking at the first week only might lead someone to come to the conclusion that this is a humanities stream course; but hopefully weeks 2 and 3 will dispel this notion and place it firmly as a computer science course.  Intelligence has many facets to it - the ability to solve problems; the ability to represent our world and reason with the representations; the capacity of memory and learning from experience; the ability to use language; the ability to peer into the future using models of the domain and plan ahead; the ability to handle uncertainty; the ability to learn from data (machine learning); and many others.  In this course we focus on problem solving by first principles. How does one model the domain and the choices available, represent the problem, and find a solution. The principal method is trial and error; or search. We "mentally" explore the possibilities and choose the best looking one. Somewhat like a beginner chess player. A chess grand-master, on the other hand, has other bows in her repertoire, like recognizing patterns and using knowledge. We will look at games like chess in the course, but only on how to play them using informed search. In two other courses that we offer on NPTEL - AI:Knowledge Representation & Reasoning and AI: Constraint Satisfaction Problems - we cover some other aspects of AI. Other colleagues offer still other aspects like machine learning and natural language processing.  Apart from the instructor this offering has two PhD students from IIT Madras - Baskaran S. and Shikha Singh. Between the three of us we should be able to respond to your queries, and have an active discussion on the Forum. I hope that the next twelve weeks or so will be a productive and enjoyable experience for all of us. Welcome the the course AI: Search Methods for Problem Solving! Deepak Khemani Baskaran S Shikha Singh

Artificial Intelligence Search Methods For Problem Solving : Week 2 is live now!!

Dear students The lecture videos for Week 2 have been uploaded for the course . The lectures can be accessed using the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=15&lesson=16 The other lectures in this week are accessible from the navigation bar to the left. Please remember to login into the website to view contents (if you aren't logged in already). As we have done so far, please use the discussion forums if you have any questions on this module. -NPTEL Team

Artificial Intelligence Search Methods For Problem Solving : Week 1 Assignment is released now !!

Dear students Assignment for Week-1 is also uploaded and can be accessed from the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=7&assessment=100 The assignment has to be submitted on or before Wednesday, [14-08-2019 23:59 IST] .   As we have done so far, please use the discussion forums if you have any questions on this module. -NPTEL Team

Artificial Intelligence Search Methods For Problem Solving : Week 1 is live now !!

Dear students The lecture videos for  Week 1  have been uploaded for the course  .  The lectures can be accessed using the following link: https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=7&lesson=8 The other lectures in this week are accessible from the navigation bar to the left. Please remember to login into the website to view contents (if you aren't logged in already). As we have done so far, please use the discussion forums if you have any questions on this module. -NPTEL Team

Artificial Intelligence Search Methods For Problem Solving : Assignment 0 released

Dear Learners,  We welcome you all to this course. The assignment 0 has been released.  This assignment is based on prerequisite of the course.  You can find the assignment in the link below:  https://onlinecourses.nptel.ac.in/noc19_cs83/unit?unit=6&assessment=99 Due date for this assignment:  2019-08-31, 23:59 IST. Please note that this assignment is for practice and it will not be graded.  Regards   NPTEL

REMINDER 2: Artificial Intelligence Search Methods For Problem Solving : REGISTER TODAY - CERTIFICATION EXAM FORM IS NOW OPEN!

Dear Learner,  Here is the much-awaited announcement on  registering  for the  Nov 2019 NPTEL online  certification exam.   1.    The  registration  for the certification exam is  open  only to those learners who have enrolled in the course. 2.    If you want to  register  for the exam for this course,  login here using the same email id which you had used to enroll to the course in Swayam portal .  3.    Till the start date of the course,  every Monday and Thursday at 5:00 PM ,  we will sync the enrollment data on the exam form. If you enroll in between,  please wait till the nearest Tuesday/Friday 10:00 AM to  register  for the exam . Once the enrollment is closed, the enrollment data will be completely loaded and you can  register  any time. 4.     Date of exam: Nov 16, 2019     •         Certification exam  registration  URL is:  http://nptelonlinecourses. iitm.ac.in/ •         Choose an exam session:  Forenoon: 9.00 AM -12.00 PM; Afternoon: 2.00PM - 5.00 PM •         Choose from the Cities where exam will be conducted:   list of exam cities 5.     Exam fees: •         If you  register  for exam and pay before  Sep 23, 10:00 AM, Exam fees will be Rs. 1000/- per exam. •         If you  register  for exam before  Sep 23, 10:00 AM and have not paid or if you have  registered  between Sep 23, 10:00 AM & Sep 30, 5:00 PM, Exam fees will be Rs. 1500/- per exam   6.     50% fee waiver for following categories: •         Students belonging to the SC/ST category: please select Yes for the SC/ST option and upload the correct Community certificate •         Students belonging to the PwD category with more than 40% disability: please select Yes for the option and upload the relevant Disability certificate.   7.     Last date for exam  registration :   Sep 30, 2019 5:00 PM (Monday).   8.     Mode of payment:   Online payment - debit card/credit card/net banking or via SPOC of college (refer to  guidelines  for “Pay via SPOC” instructions)   9.     HALL TICKET : The hall ticket will be available for download tentatively by  2 weeks prior to exam date .  We will confirm the same through an announcement once it is published.   10.  Final score on certificate: 25% of assignment score + 75% of certification exam score. Award of certificate:  No hard copy of certificate will be printed. The soft copy of certificate will be awarded only to those candidates who  register  for the exam, attend the certification examination and whose  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.     Please check the Announcements section of your course for further details on this.    11.  FOR CANDIDATES WHO WOULD LIKE TO WRITE MORE THAN 1 COURSE EXAM: - you can add or delete courses and pay separately – till the date when the exam form closes. Same day of exam – you can write exams for 2 courses in the 2 sessions. Same exam center will be allocated for both the sessions.   12.  Data changes   Following are the data that can be changed once the exam form is submitted (Last date for data changes:  30 Sep 2019, 5:00 PM ): •        Data that can be changed in form by candidates themselves: Name, DOB, Address, College name, Photo, Signature, Exam city •        Data that can be changed by Email request to us : Course selected, exam shift. For changes in these parameters, you may send email to  [email protected]   giving your Application number, email id and name.  •        No changes will be entertained in any details after  30 Sep 2019, 5:00 PM.   13.  LAST DATE FOR CANCELLING EXAMS and getting a refund:  30 Sep 2019, 5:00 PM 14. Click here to view Timeline and Guideline :  Guideline Thanks & Regards, NPTEL TEAM

Welcome to SWAYAM-NPTEL Online Course - Artificial Intelligence: Search Methods for Problem Solving

• Every week, about 2.5 to 4 hours of videos containing content by the Course instructor will be released along with an assignment based on this.  Please watch the lectures, follow the course regularly and submit all assessments and assignments before the due date. Your regular participation is vital for learning and doing well in the course. This will be done week on week through the duration of the course.
• Please do the assignments yourself and even if you take help, kindly try to learn from it. These assignment will help you prepare for the final exams. Plagiarism and violating the Honor code will be taken very seriously if detected during the submission of assignments. 
• The announcement group - will only have messages from course instructors and teaching assistants - regarding the lessons, assignments, exam registration, hall tickets etc.    
• The discussion forum (Ask a question tab on the portal) - is for everyone to ask questions and interact.Anyone who knows the answers can reply to anyone's post and the course instructor/TA will also respond to your queries. Please make maximum use of this feature as this will help you learn much better.
• If you have any questions regarding the exam, registration, hall tickets, results, queries related to the technical content in the lectures, any doubts in the assignments, etc can be posted in the forum section
• The course is free to enroll and learn from. But if you want a certificate, you have to register and write the proctored exam conducted by us in person at any of the designated exam centres.
• The exam is optional for a fee of  Rs 1000/- (Rupees one thousand only).
• Date and Time of Exams:  16 November 2019  ,Morning session 9am to 12 noon; Afternoon Session 2pm to 5pm.
• Registration url:  Announcements will be made when the registration form is open for registrations.
• The online registration form has to be filled and the certification exam fee needs to be paid. More details will be made available when the exam registration form is published. If there are any changes, it will be mentioned then.
• Please check the form for more details on the cities where the exams will be held, the conditions you agree to when you fill the form etc.
• Average assignment score = 25% of 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

A project of

In association with