1. Compare between monotonic and commutative production system. 2. What is uninformed (or blind) search and how does it differ from informed (or

Transcription

1 1. Compare between monotonic and commutative production system. 2. What is uninformed (or blind) search and how does it differ from informed (or heuristic) search? 3. Compare between DFS and BFS. 4. Use the DFS algorithms to solve the Towers of Hanoi problem. 5. Use the BFS algorithms to solve the Towers of Hanoi problem. 6. How does depth limited search differ from Iterative Deepening Search? 7. In general, IDS is not complete. Why? 8. Identify a major disadvantage of bidirectional search. 9. Provide the search order for the nodes shown in following Figure with DFS. 10. Provide the search order for the nodes shown in following Figure with BFS, 11. Provide the search order for the nodes shown in following Figure with DLS (d=2). 12. Provide the search order for the nodes shown in following Figure with IDS (start depth = 1). 13. Provide the search order for the nodes shown in following Figure with BIDI (start node A, goal node I).

2 14. Using the Uniform Cost Search algorithm, find the shortest path from A to F in following Figure. 15. The missionaries and cannibals problem: 3 missionaries and 3 cannibals stand at the left bank of the river. They wish to cross over the river. There is a boat to ferry them across the river but it can hold at most 2 persons. Whenever there are more cannibals than missionaries on either bank of the river there is a risk of attack on the missionaries. The problem is to find out whether there is any possible sequence of moves to ferry 6 persons from left bank to right bank without any risk of attack on the missionaries. i. Formulate the problem as state-space search problem. ii. Draw the search graph depicting the possible moves to solve the problem. 16. Give a complete state-space search problem formulation and the solution for the following problem. i. Using only four colors, you have to color a planar map in such a way that no two adjacent regions have the same color. 17. Give a complete state-space search problem formulation the solution for the following problem. i. A 3-foot-tall monkey is in a room where some bananas are suspended from the 8- foot ceiling. He would like to get the bananas. The room contains two stackable, movable, climbable 3-foot-high crates. 18. Give a complete state-space search problem formulation the solution for the following problem. i. You have three jugs, measuring 12 gallons, 8 gallons, and 3 gallons, and a water faucet. You can fill the jugs up or empty them out from one to another or onto the ground. You need to measure out exactly one gallon. 19. What are advantages and disadvantages in finding solutions with DFS? 20. What are advantages and disadvantages in finding solutions with BFS? 21. Design heuristics for solving the 8-puzzle problem.

3 22. Design heuristics for solving the 8-queen problem 23. Discuss on various pitfalls and their corresponding remedies for hill climbing searching techniques. 24. How does simulated annealing search differ from hill climbing search technique? 25. What is the purpose of the Monte Carlo step in the simulated annealing algorithm? 26. Compare the intensification and diversification modifications of Tabu search. 27. Best-first search uses a combined heuristic to choose the best path to follow in the state space. Define the two heuristics used (h(n) and g(n)). 28. Best-first search uses both an OPEN list and a CLOSED list. Describe the purpose of each for the best-first algorithm. 29. Describe the differences between best-first search and greedy best-first search. 30. Describe the differences between best-first search and beam search. 31. What are the advantages of beam search over best-first search? 32. A* search uses a combined heuristic to select the best path to follow through the state space toward the goal. Define the two heuristics used (h(n) and g(n)). 33. Explain A* algorithm for solving 8-puzzle problem. 34. How does AO* algorithm differ from A* algorithm. 35. Provide the essence of a constraint satisfaction problem. 36. What are some of the major applications of constraint satisfaction search? 37. Compare and contrast the CSP algorithms of backtracking, forward checking, and look ahead. 38. Apply constraint satisfaction method to solve the following crypt-arithmetic problem- SEND + MORE = MONEY. 39. What do you mean by admissibility and consistency of a heuristic function? 40. Validate with explanation that if heuristic is consistent then the heuristic is admissible but the converse is not true. 41. What is meant by adversarial search, and how does it differ from traditional tree search? 42. Illustrate MINIMAX procedure with an example. 43. Given the game tree shown in Figure, what is the value at the root node? 44. How does alpha-beta pruning work in game playing?

4 45. Consider the two-player game described in following Figure. a. Draw the complete game tree, using the following conventions: Write each state as (sa, se), where sa and.5.8 denote the token locations. Put each terminal state in a square box and write its game value in a circle. Put loop states (states that already appear on the path to the root) in double square boxes. Since their value is unclear, annotate each with a "?" in a circle. b. Now mark each node with its backed-up minimax value (also in a circle). Explain how you handled the "?" values and why. c. Explain why the standard minimax algorithm would fail on this game tree and briefly sketch how you might fix it, drawing on your answer to (b). Does your modified algorithm give optimal decisions for all games with loops? d. This 4-square game can be generalized to n. squares for any n > 2. Prove that A wins if n is even and loscs if it is odd. Figure 45.The starting position of a simple game. Player A moves first. The two players take turns moving, and each player mus1 move his token to an open adjacent space in either direction. If the opponent occupies an adjacent space, then a player may jump over the opponent to the next open space if any. (For example, if A is on 3 and B is on 2, then A may move back to 1.1. The game ends when one player reaches the opposite end of the board. If player A teaches space 4 first, then the value of the game to A is +1; if player.3 reaches space 1 first, then the value of the game to A is How do you evaluate any search technique? 46. When does simulated annealing behave like hill climbing? 47. Compare blind search with heuristic search. 48. Consider the following logic puzzle: In five houses, each with a different color, live five persons of different nationalities, each of whom prefers a different brand of candy, a different drink, and a different pet. Given the following facts, the questions to answer are 'Where does the zebra live, and in which house do they drink water?" The Englishman lives in the red house. The Spaniard owns the dog. The Norwegian lives in the first house on the left. The green house is immediately to the right of the ivory house. The man who eats Hershey bars lives in the house next to the man with the fox. Kit Kats are eaten in the yellow house. The Norwegian lives next to the blue house. The Smarties eater owns snails. The Snickers eater drinks orange juice. The Ukrainian drinks tea. The Japanese eats Milky Ways. Kit Kats are eaten in a house next to the house where the horse is kept. Coffee is drunk in the green house. Milk is drunk in the middle house.

5 Discuss different representations of this problem as a CSP. Why would one prefer one representation over another? 49. The monkey-and-bananas problem is faced by a monkey in a laboratory with some bananas hanging out of reach from the ceiling. A box is available that will enable the monkey to reach the bananas if he climbs on it. Initially, the monkey is at A, the bananas at B, and the box at C. The monkey and box have height Law, but if the monkey climbs onto the box he will have height High, the same as the bananas. The actions available to the monkey include Go from one place to another, Push an object from one place to another, ClimbUp onto or ClirnbD own from an object, and Grasp or tin grasp an object. The result of a Grasp is that the monkey holds the object if the monkey and object are in the same place at the same height. a. Write down the initial state description. b.write the six action schemas. c. Suppose the monkey wants to fool the scientists, who are off to tea, by grabbing the honoring, hot leaving the box in its original place Write this as a general goal (i, not assuming that the box is necessarily at C) in the language of situation calculus. Can this goal be solved by a classical planning system? d. Your schema for pushing is probably incorrect, because if the object is too heavy, its position will remain the same when the Push schema is applied. Fix your action schema to account for heavy objects. 50. Write prolog program to implement 4-puzzle using hill climbing algorithm. 51. Write prolog program to find the GCD of two numbers. 52. Write prolog program to find the reverse of a list. 53. Write prolog program to find the Union of two lists. 54. Write prolog program to solve Tower of Hanoi through PROLOG. 55. Write prolog program to remove an item from i th position of a given list. 56. Write prolog program to find the Intersection of two lists. 57. Write prolog program to N-times left rotate shift of a list. 58. Write prolog program to implement 4-puzzle using DFS algorithm. 59. Write prolog program to find the product of digits of a given natural number. 60. Write prolog program to find n th Fibonacci number. 61. Write prolog program to find the maximum element of a list. 62. Write prolog program to find whether a number is prime number or not. 63. Write prolog program to find the factorial of a number. 64. Write prolog program to delete an element from the list for all the occurrences. 65. Write prolog program to find the summation of n terms of the series i i where i ranges from 1 to n.