AbstractsComputer Science
Algorithms for solving the Rubik's cube
| Institution: | KTH Royal Institute of Technology |
|---|---|
| Department: | |
| Year: | 2015 |
| Keywords: | Natural Sciences; Computer and Information Science; Computer Science; Naturvetenskap; Data- och informationsvetenskap; Datavetenskap (datalogi); Master of Science in Engineering - Computer Science and Technology; Civilingenjörsexamen - Datateknik; Datalogi; Computer Science |
| Record ID: | 1334420 |
| Full text PDF: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-168427 |
Abstract
There are different computational algorithms for solving the Rubik's cube, such as Thistlewaite's algorithm, Kociemba's algorithm and IDA* algorithm. This thesis evaluates the efficiency of two algorithms by analyzing time, performance and how many moves are required to solve the Rubik's cube. The results show that the Thistlewaite's algorithm is less efficient than the IDA* algorithm based on time and performance. The paper attempts to answer which algorithm is more efficient for solving the Rubik's cube. It is importation to mention that this report could not prove which algorithm is most efficient while solving the whole cube due to limited data, literature studies and authors are used as an argument to prove that the Korf's algorithm is more efficient.
