Hungry Bear is a python implementation of the A-star search algorithm. The algorithm efficiently finds a path between two nodes in a graph (in this case a bear and a pot of honey). The algorithm is applied to the graph iteratively; the bear moving one node closer to the honey with each iteration.

Short video of Hungry Bear with a random selection of graphs

To install

pip install tornado
python main.py

Point your (WebSocket-compatible) browser to http://localhost:8888 and watch.