The purpose of this python program is to analyze different search heuristics for the problem of searching for the correct action sequence to solve a rubiks cube. As the layers of a rubik's cube increases so will the time taken for each search. We will analyze the time complexity in nodes expanded for each of the searchs/heuristics.
An interactive notebook can be found at https://colab.research.google.com/drive/1PSVxJmEmfv5KVFzPI1LCdJEKU6ow5-Ml?usp=sharing