solving the Romania Map problem(getting from Arad to Bucharest) using following algorithms:
- BFS
- DFS
- Depth Limited DFS
- GreedyBFS
- Iterative Depening
- Unicorm Cost Search
- A Star
all of them are implemented in both graph and Tree Search mode
Implementations of Graph and Tree search algorithms to solve the Romania Map problem - Artificial Intelligence Course (Fall 2018)
Java