LISP Project
Budget: $30 – $250 USD
Missionaries and Cannibals Problem 1: Write Lisp code that solves the missionaries and cannibals
problem assuming that you have one boat, 15 cannibals, and 15 missionaries. Assume that the boat can
carry at most six people and there is a single boat available. You cannot have the boat moving with no
one on board. The cannibals should never outnumber the missionaries (either on the boat or on both
sides of the river). You can write your own code or modify the code from the course textbook website to
solve the problem. You need to print out the sequence of moves leading to a correct solution. Try the
same problem with 20 cannibals and 20 missionaries.
8-Puzzle Problem 2: Implement the A* algorithm for searching trees in Lisp. Do not use the course textbook website code or other code from the Internet. Implement a counter that counts the number of nodes expanded and prints this number at the end of the search. Use your code to solve the 8-puzzle problem with the heuristic being the number of misplaced tiles and start state: ((E,1,3),(4,2,5),(7,8,6)). The goal state is: ((1,2,3),(4,5,6),(7,8,E)). Print the number of nodes expanded. You only need to show the states generated during the search process. Your code should detect infeasible puzzles.
problem assuming that you have one boat, 15 cannibals, and 15 missionaries. Assume that the boat can
carry at most six people and there is a single boat available. You cannot have the boat moving with no
one on board. The cannibals should never outnumber the missionaries (either on the boat or on both
sides of the river). You can write your own code or modify the code from the course textbook website to
solve the problem. You need to print out the sequence of moves leading to a correct solution. Try the
same problem with 20 cannibals and 20 missionaries.
8-Puzzle Problem 2: Implement the A* algorithm for searching trees in Lisp. Do not use the course textbook website code or other code from the Internet. Implement a counter that counts the number of nodes expanded and prints this number at the end of the search. Use your code to solve the 8-puzzle problem with the heuristic being the number of misplaced tiles and start state: ((E,1,3),(4,2,5),(7,8,6)). The goal state is: ((1,2,3),(4,5,6),(7,8,E)). Print the number of nodes expanded. You only need to show the states generated during the search process. Your code should detect infeasible puzzles.