Route Planning for Taipei MRT Station
Route Planning for Taipei MRT Station is a C++ program that can search for the path that takes the least time from the starting Taipei MRT station to the destination with the following search techniques.
Search Technique
- Depth First
- Breadth First
- Hill Climbing
- Least Cost
How to Use
How to Run
Evaluating a Search
- How is a solution found?
- How good is the solution?
Task List
- Update the route of Taipei MRT
- Support for searching with English station name
- Experiment heuristic searches like hill-climbing search by substituting the breadth-first technique and observe the result.
- When finding multiple solutions or optimal solution, substitute breadth-first search.
- Try other real-world situations.