@inproceedings{a7c16179496944e68bab9d2d63b4e067,
title = "An optimised implementation of the A∗ algorithm using the STL",
abstract = "In this paper we present our work on developing a fast, memory efficient and student friendly implementation of the A∗ algorithm for use in teaching using the game Dalek World. We first present our criteria for evaluating an implementation of the A∗ namely that it should be easy for students to understand, support multiple heuristics and demonstrate some of the optimisation issues which are relevant to implementing path finding. We compare three candidate A∗ implementations using various data structures to hold the open and closed lists. We conclude that our own implementation based on the STL map and priority queue data structures is both the easiest to learn from and also the fastest.",
author = "Bryan Duggan and Fred Mtenzi",
note = "Publisher Copyright: {\textcopyright} 2006 The University of Wolverhampton.; 8th International Conference on Computer Games: Artificial Intelligence and Mobile Systems, CGAMES 2006 ; Conference date: 24-07-2006 Through 27-07-2006",
year = "2006",
language = "English",
series = "Proceedings of CGAMES 2006 - 8th International Conference on Computer Games: Artificial Intelligence and Mobile Systems",
publisher = "University of Wolverhampton",
pages = "86--90",
editor = "Quasim Mehdi and Adel Elmaghraby",
booktitle = "Proceedings of CGAMES 2006 - 8th International Conference on Computer Games",
}