A benchmark of algorithms for the Professor’s Cube

Abstract: Rubik’s Cube is a well known puzzle that has entertained for decades. This thesis studies two relatively new phenomenons; the 53 cube, also known as the Professor’s Cube , and the practice of speedcubing. This report presents two existing algorithms developed by speedcubers that enable human executors to quickly solve the puzzle. The algorithms are implemented and their results compared in order to show which one requires fewer steps to solve the puzzle. The conclusion is that it is faster to use the original Davenport algorithm instead of the newer version by Monroe if the number of twists is your limiting factor.