A* is an optimal graph-search algorithm that is commonly considered be to "artificial intelligence." This supposed intellect comes from the use of heuristics, or computational shortcuts that usually increase the speed to find a goal. This project is meant to provide a browser-based workspace for the development and demonstration of the A* algorithm in two-dimensions. The heuristic here prefers to explore paths whose sum of current length and distance to goal is minimized. The Assignment 1 and 2 maps demonstrate this heuristic working well and working poorly, respectively.

A live version is available at https://mgatc.github.io/ai-workspace/. Use Google Chrome for best results.

1. JSXGraph. A javascript geometry library for visualization. https://jsxgraph.uni-bayreuth.de/wp/index.html

2. Google Closure Library. Used for Priority Queue. https://developers.google.com/closure/library

1. Current implementation uses naive collision detection methods, slowing performance in environments with a large number of obstacles. Implementing a physics engine could improve this project.
2. The UI could be improved to maximize the size of the user viewpoint into the search world. See https://mgatc.github.io/bounded-degree-plane-spanners/.