Travelling Salesman Problem (TSP) is a classical problem to find the best and minimum solution for a salesman to travel all of the city and return to the start point of his journey. With the problem, there are several ways to get the best solution using different algorithms. Backtrack algorithm is one of algorithm that can be used to find a solution in TSP. Backtrack algorithm has weakness in processing time/duration, whether the solution is always optimal. The new algorithm, called Intelligent Water Drops (IWD), is one of meta-heuristic algorithm that inspired from the motion of water flow in a river. IWD also an optimization algorithm, this algorithm will search for the optimal path or solution for the problem. IWD is chosen because it has better performance in time/duration rather than Backtrack algorithm in finding the solution. In this paper will explain how the workings of IWD and compare with Backtrack to clarify the algorithm. This algorithm shows a magnificent result to solve TSP with minimum cost and time.