Three missionaries and three cannibals are on one side of a river, along with a boat that can hold one or two people. Find a way to get everyone to the other side, without ever leaving a group of
missionaries in one place out numbers by the cannibals in that place.
i) Number of trips is not restricted
ii) Both the missionary and cannibal can row the boat.
Generate the production system and find out which rules are used successively to achieve the goal.
Write the output of the following
i) (car(cdr (a d bc))
ii) (Member 'b'(a b d))
iii) (cons 'a' (f (b c) d)
iv) (zerop .0000003)
Consider the following set of facts:
1. Marcus was a man.
2. All men are mortal.
3. Marcus was born in 40 A.D.
4. Marcus was a Pompeian.
5. All Pompeians died when the volcano erupted in 79 A.D.
6. No mortal lives longer than 150 years.
7. It is now 1991.
8. Alive means not dead.
9. If someone dies, then he is dead at all later times.
Solve by Resolution "Is Marcus alive?"
Differentiate between Hill climbing and Steepest Ascent Hill climbing algorithm. State the situations like Local Maxima, Platue and Ridge and it's remedies,
Solve following 8 puzzle problem using A algorithm:
Initial state and final state is given. Using sliding to legal movements, find the shortest solution using heuristic function that never over estimates the number of steps to the goal. The legal moves can be that result from trying the four actions (blank moves Left, Right, Up, or Down). Also state the basis of movements in the search space to reach the goal state.