Skip to content

Latest commit

 

History

History
8 lines (5 loc) · 324 Bytes

README.md

File metadata and controls

8 lines (5 loc) · 324 Bytes

TSP-Travelling-Salesman-Problem

Solving Travelling Salesman Problem (TSP) using A* (star), Recursive Best First Search (RBFS), and Hill-climbing Search algorithms

Author: Hamdi Altaheri, King Saud University, Saudi Arabia

For a discussion of the results, please refer to: https://sites.google.com/view/tsp-solve