Today, the increased traffic and complex modern road network have made finding a good route from one location to another a non-trivial task. Many search algorithms have been proposed to solve the problem, and the most well-known being Dijkstra’s algorithm, Johnson’s algorithm and A*. While these algorithms are effective for path finding, they are wasteful in terms of computation. In this paper, we present a study to examine both uninformed search and heuristic search based on some major cities and towns in Borneo Island. We propose a novel algorithm for intelligent route finding using better evaluation criteria and the notion of cumulative proximity score. We show that this proposed technique is able to reduce the time and space required in computation, and also produce better result in terms of accuracy and shortness of path found.