Answer the given question with a proper explanation and step-by-step solution. Write a Lisp program to solve the Missionaries & Cannibals problem using any state space search algorithm. Your project should be invoked by the function call (mac) Your program should output the sequence of moves necessary to solve the problem, or nil if no solution exists. This is your first large Lisp project and it will take some time for you to develop it. It will help as you design your program if you break the work into individual functions. The first function I would recommend you start on immediately is (expand-node n) which should take a state n in the Missionaries & Cannibals state space and generate a list containing all legal successor states.
Answer the given question with a proper explanation and step-by-step solution.
Write a Lisp
Step by step
Solved in 3 steps