Heuristic Searching: A* Search
Nazmul Hasan · IOSR Journal of Computer Engineering · 2012
Searching has a great impact on computer science.There are lots of searching algorithms.Among them, A* search algorithm is one of the most promising algorithm.A* search algorithm is more efficient than the other searching algorithm, because of its heuristic characteristic.A* search is widely used in path finding and graph traversal among the points, called nodes.Due to the heuristic characteristic A* search must find the goal with the minimum cost, if obviously there is a goal state.For this reason there are many application of this.The aim of this paper is to understand the A* search technique, its characteristics, mathematical representation, some graphical representation.