Current Proceedings on Technology
Yazarlar: Anca Elena Iordan
Konular:-
Anahtar Kelimeler:Heuristic function,A* search method,15-puzzle,UML,Java
Özet: Main objective of this paper is to introduce a new heuristic function to obtain optimal solve of the 15-puzzle game using A* informed search method. This new heuristic function, being defined as double of the Cebisev distance, is more informed than the Manhattan heuristic function that represents the most efficient admissible function used in the present in solving that game. To compare the experimental results, the A* search method is implemented using Java programming language. The effect of using Cebisev heuristic in implementation of A* method to obtain optimal solution leads to improve the results from the point of view of space complexity, as well of time complexity.