•	Implemented a modified Travelling Salesman problem which involved finding the shortest tour of a graph with two heuristics viz. -- straight line distance and minimum spanning tree •	The problem was solved using Greedy search and later optimized using A* search technique