Change search
ReferencesLink to record
Permanent link

Direct link
A benchmark of algorithms for the Professor’s Cube
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]

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.

Place, publisher, year, edition, pages
National Category
Computer Science
URN: urn:nbn:se:kth:diva-168198OAI: diva2:814688
Available from: 2015-05-28 Created: 2015-05-28 Last updated: 2015-05-28Bibliographically approved

Open Access in DiVA

fulltext(594 kB)164 downloads
File information
File name FULLTEXT01.pdfFile size 594 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
School of Computer Science and Communication (CSC)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 164 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 69 hits
ReferencesLink to record
Permanent link

Direct link