CSC468: Artificial Intelligence Fall 2018 Assignment 1
At an airport, three cargo planes headed to the same destination need to be filled to their maximum capacity of 1,500,1,200 and 800 Lbs with parcels. There are three different sizes of parcels distributed as follows: 10 50-Lb, 20 75-Lb, and 15 100-Lb parcels. The parcels are located in a depot and need to be loaded into the planes. A van can only bring three parcels at a time with the constraint that each of these parcels needs to go to a different plane. Can the three planes be filled to maximum capacity? If so, what is the smallest number of trips that the van will need to take to do so? If not, what is the closest to maximum capacity that can be reached on each plane?
Solve this problem in Scheme. In particular, implement three different solutions to the problem, each using a different search algorithm: Depth-First, Breadth-First and Iterative Deepening.
Write a report that discusses your experience using each of these algorithms both in terms of your programming experience and in terms of the solutions each algorithm finds.
Bonus question: Use a heuristic search algorithm to solve the problem. Discuss your heuristic function as well as your programming experience and the solution found by your heuristic algorithm in your report.
Good luck! (And do try to see the good side of Scheme and have fun with it!)