A simple literature review will reveal a plethora of maze solving algorithms. However, merely executing an algorithm in a sequence of steps is not worthy of present day research, simply because there is nothing to differentiate it from the millions of sequential executions taking place in an ordinary CPU. Furthermore, if the system finds itself in an unknown state, most algorithms do not have a fallback mechanism built into the algorithm. Engineers will have to add some sort of safety check just to get the system back to a known condition. There are times when even this is not sufficient since the exact sequence of states and timing is crucial for the successful termination of the algorithm.