Unformatted text preview: graph, A*-graph) for (3,3), (10,10), and (30,30) missionaries and cannibals. Print out the source code. Also, use a table to report the number of states generated and the computing time for all the tests. Denote if the solution is optimal. If you found that your program fails due to the memory bound, please just report so. However, please describe how you test your program to make sure that the program works correctly and memory is really the bottleneck. (e.g. show that your program can find correct solutions for smaller problems) For tree search with DFS, the search may get stuck in a loop. You can simply report it. Or, you can choose to implement iterative deepening to fix it, but it is optional....
View Full Document
- Spring '09
- Artificial Intelligence, A* search algorithm, Tree Search