Search Methods

Develop in Python, a problem-solving agent can look for a path, according to different strategies, between two different cities.

---

Contributors

Diogo Marques	Diogo Oliveira	Stéphane Monteiro

Requirements

Data from ./data folder to be loaded:

• Cities (@diogofalken)
• Cities Straight Line to Faro (@diogofalken)

The agent must implement two blind search methods:

• Uniform Cost (@diogofalken)
• Uniform Cost with visited (@diogofalken)
• Depth-Limited (@Kurvatov)

You must also implement two methods of heuristic search:

• Sofrega Search (@EdwinOliveira)
• A* (@Kurvatov)

Getting started

1. Clone this repository
2. cd search-methods
   
3. Run python3 src/main.js to run the program

⁉️ If you are on Windows you need to change main.js fileUtils call because of path issues between OS.

    fileUtils = FileUtils("../data/cities.json", "../data/citiesSL.json")

License

This project is licensed under the MIT License - see the LICENSE.md file for details.