The efficiency of the A* algorithm’s implementations in selected programming languages

• Autorzy: Klimaszewski J.
• Języki publikacji: EN

Abstrakty

EN

This article presents results of the experiment, in which data structures, used by the A* algorithm (i.e. priority queue and hash table), were tested. A* algorithm was used to solve 15-puzzle, where puzzle’s state was kept in the 64-bit integer variable. The algorithm used either built-in data structures (such as Python’s dictionary) or provided by a standard library (such as unordered map in the C++ Standard Template Library).

Słowa kluczowe

EN

path finding; data structures; artificial intelligence

• Wydawca: Komisja Informatyki Polskiej Akademii Nauk, Oddział w Gdańsku
• Czasopismo: Journal of Theoretical and Applied Computer Science
• Rocznik: 2014
• Tom: Vol. 8, nr 2
• Strony: 63--71
• Opis fizyczny: Bibliogr. 5 poz., rys., tab.

Twórcy

autor

Klimaszewski J.

• Faculty of Computer Science and Information Technology,West Pomeranian University of Technology, Szczecin, Poland

Bibliografia

• [1] Peter E. Hart, B. R., Nils J. Nilsson: A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE transactions of systems science and cybernetics, 4(2), 1967.
• [2] Stroustrup, B.: What is C++0x? CVu, 21, 2009.
• [3] Lambert, K. A.: Fundamentals of Python: First Programs. Cengage Learning, 2011.
• [4] Eckel, B.: Thinking in Java: The Definitive Introduction to Object-Oriented Programming in the Language of the World-Wide Web, 3rd Edition. Prentice Hall PTR, 2002.
• [5] Slocum, J., Weisstein, E. W.: 15 Puzzle. From MathWorld–A Wolfram Web Resource. http://mathworld.wolfram.com/15Puzzle.html. Last visited on 20/04/2014.