Note: d1=5 d2=7 Open list and closed list for every iteration

Subject: Artificial Intelligence.

Let dl = last digit of your registration number Define x-(d1%4)+3 and y=x+1 Consider the 2-Jugs problem such that the capacity of Jug-1 is x liters and capacity of Jug-2 is y liters. The problem is formulated as below: SE4813 - Artificial Intelligence Page 2 of 6 Initial state: (0,0) - Both jugs are empty Operators: 1) Fill Jug-1 if it is not already full 2) Fill Jug-2 if it is not already full 3) Empty Jug-1 if it is not already empty 4) Empty Jug-2 if it is not already empty 5) Pour water from Jug-1 to Jug-2 until Jug-1 is empty or Jug-2 is full 6) Pour water from Jug-2 to Jug-l until Jug-2 is empty or Jug-1 is full Goal state: (0, 2) The problem is to be solved using an informed search algorithm for which the following heuristic function has been designed: h(n) - Amount of water in Jug-1 + Amount of water in Jug-2 Write first ten states that will be examined if a. Greedy search is performed b. A search is performed. Let dl = last digit of your registration number Define x-(d1%4)+3 and y=x+1 Consider the 2-Jugs problem such that the capacity of Jug-1 is x liters and capacity of Jug-2 is y liters. The problem is formulated as below: SE4813 - Artificial Intelligence Page 2 of 6 Initial state: (0,0) - Both jugs are empty Operators: 1) Fill Jug-1 if it is not already full 2) Fill Jug-2 if it is not already full 3) Empty Jug-1 if it is not already empty 4) Empty Jug-2 if it is not already empty 5) Pour water from Jug-1 to Jug-2 until Jug-1 is empty or Jug-2 is full 6) Pour water from Jug-2 to Jug-l until Jug-2 is empty or Jug-1 is full Goal state: (0, 2) The problem is to be solved using an informed search algorithm for which the following heuristic function has been designed: h(n) - Amount of water in Jug-1 + Amount of water in Jug-2 Write first ten states that will be examined if a. Greedy search is performed b. A search is performed