Using search you should formulate a plan that Ethan can follow to complete the mission. An optimal plan is one where the deaths are at a minimum as a first condition. Given two plans with the same number of deaths, the more optimal plan is the one where the total damage incurred by the IMF members is minimal. The following search strategies will be implemented and each will be used to help Ethan:
- Breadth-first search.
- Depth-first search.
- Iterative deepening search.
- Uniform-cost search.
- Greedy search with at least two heuristics.
- A* search with at least two admissible heuristics.