Current Proceedings on Technology

Current Proceedings on Technology

Defining a new Heuristic that Optimizes the A* Search Method Applied to Solve the 15-Puzzle

Yazarlar: Anca Elena Iordan

Cilt 3 , Sayı - , 2013 , Sayfalar -

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.


ATIFLAR
Atıf Yapan Eserler
Henüz Atıf Yapılmamıştır

KAYNAK GÖSTER
BibTex
KOPYALA
@article{2013, title={Defining a new Heuristic that Optimizes the A* Search Method Applied to Solve the 15-Puzzle}, volume={3}, number={0}, publisher={Current Proceedings on Technology }, author={Anca Elena Iordan}, year={2013} }
APA
KOPYALA
Anca Elena Iordan. (2013). Defining a new Heuristic that Optimizes the A* Search Method Applied to Solve the 15-Puzzle (Vol. 3). Vol. 3. Current Proceedings on Technology .
MLA
KOPYALA
Anca Elena Iordan. Defining a New Heuristic That Optimizes the A* Search Method Applied to Solve the 15-Puzzle. no. 0, Current Proceedings on Technology , 2013.