Deimosy Demo

by Tal L


Named after the smaller and outermost of the two moons of the planet Mars, Deimosy is a pathfinding simulator for probes navigating the surface of Mars. In its core, Deimosy relies on a rendition of the A* search algorithm that calculates the cost of a step based on the absolute value of the difference between the weight of a given node and that of its neighbor, with the weight of a node being the equivalent of its height. Built utilizing PIL, numpy, matplotlib, and a rendition of the A* search algorithm.