Change search
CiteExportLink to record
Permanent link

Direct link
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Algorithms for solving the Rubik's cube: A study of how to solve the Rubik's cube using two famous approaches: The Thistlewaite's algorithm and IDA* algorithm.
KTH, School of Computer Science and Communication (CSC).
2015 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

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. 

Place, publisher, year, edition, pages
2015. , 46 p.
National Category
Computer Sciences
URN: urn:nbn:se:kth:diva-168427OAI: diva2:816583
Subject / course
Computer Science
Educational program
Master of Science in Engineering - Computer Science and Technology
Available from: 2015-06-03 Created: 2015-06-03 Last updated: 2018-01-11Bibliographically approved

Open Access in DiVA

fulltext(1302 kB)