Abstract
In this project a problem of solving a rubik’s cube is presented. Here multiple algorithms can be used to solve it. The algorithm considered brute-force, depth first search, is here compared to two A* algorithms, with two different heuristics. The two heuristics are also compared to eachother to see how different heuristics can affect runtime.
Read more in report
