Artificial Intelligence Assignment: 
Major PP Assignment: Missionaries and Cannibals Implementation. Write a program that uses the state space you designed for the Missionaries and Cannibals problem. The data structure you choose can be a graph or a tree. Your program should search through the state space searching for a solution. If a solution is found, it should indicate the actions (in order) to get everyone across safely. If no solution is possible, then the program should indicate no solution was found. Output for your program could manifest in many ways, but it should be clear what is happening, For example, one action in the solution output could be: Missionary from shore a to shore b. Another action could be something like: Cannibal from shore b to shore a. It's up to you, but if the grader can't tell what's going on, you will not get credit. Heck, if you are feeling adventurous, you could animate it using ASCII art or some other graphics. Also, your state diagram MUST be implemented using a data structure of your choice AND you must use one of the search algorithms covered in the text and class. Which one is up to you. If none of these are done, you will get no credit. You may use whichever programming language you wish (Python, C++, Lisp, Java, C). Include a comment header in your source code file that indicates which data structure you chose (graph or tree) and which search algorithm you decided to use. Hints: Don't forget that there is a ton of sample code provided by the author through their Git repository I showed you. Feel free to base your solution on that. . Don't forget that the nodes being generated are being done dynamically. The text implements data structures in a way that is probably different than you learned in your data structures class. Reminder: I will not coauthor or debug your programs for you, but feel free to ask any questions you may have. Make sure you understand the pseudocode for the algorithm you are implementing and the main components of it. To maximize your chance for partial credit, comment your code and identify the major parts (GOAL-TEST, ACTIONS, SUCCESSOR, etc) Submission Instructions: Submit your source code in a single file. . Include in the comments header how to run your program. Do not upload screenshots. . Do not upload an executable. Do not zip up your source code file or archive it in any way. Major PP Assignment: Missionaries and Cannibals Implementation. Write a program that uses the state space you designed for the Missionaries and Cannibals problem. The data structure you choose can be a graph or a tree. Your program should search through the state space searching for a solution. If a solution is found, it should indicate the actions (in order) to get everyone across safely. If no solution is possible, then the program should indicate no solution was found. Output for your program could manifest in many ways, but it should be clear what is happening, For example, one action in the solution output could be: Missionary from shore a to shore b. Another action could be something like: Cannibal from shore b to shore a. It's up to you, but if the grader can't tell what's going on, you will not get credit. Heck, if you are feeling adventurous, you could animate it using ASCII art or some other graphics. Also, your state diagram MUST be implemented using a data structure of your choice AND you must use one of the search algorithms covered in the text and class. Which one is up to you. If none of these are done, you will get no credit. You may use whichever programming language you wish (Python, C++, Lisp, Java, C). Include a comment header in your source code file that indicates which data structure you chose (graph or tree) and which search algorithm you decided to use. Hints: Don't forget that there is a ton of sample code provided by the author through their Git repository I showed you. Feel free to base your solution on that. . Don't forget that the nodes being generated are being done dynamically. The text implements data structures in a way that is probably different than you learned in your data structures class. Reminder: I will not coauthor or debug your programs for you, but feel free to ask any questions you may have. Make sure you understand the pseudocode for the algorithm you are implementing and the main components of it. To maximize your chance for partial credit, comment your code and identify the major parts (GOAL-TEST, ACTIONS, SUCCESSOR, etc) Submission Instructions: Submit your source code in a single file. . Include in the comments header how to run your program. Do not upload screenshots. . Do not upload an executable. Do not zip up your source code file or archive it in any way
