Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Benchmarking Rubik’sRevenge algorithms
KTH, School of Computer Science and Communication (CSC).
KTH, School of Computer Science and Communication (CSC).
2013 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

This Bachelor thesis paper investigates 2 different methods used to solve the Rubik’s Cube

4x4x4 puzzle. The analyzed methods are Reduction and Big Cube method. We have

implemented the cube and the two solvers in Python. Through a series of tests we have

concluded that the Big Cube method has a better average move count as well as a low standard

deviation in comparison to the Reduction method. However the reduction method has a lower

minimum move count and consists of fewer algorithms. The best approach would be to combine

both methods to form an optimal solution.

Abstract [sv]

Denna kandidatexamensuppsats undersöker två olika metoder som används för att lösa Rubiks

Kub 4x4x4. Metoderna som analyseras är Reduction och Big Cube. Vi har implementerat kuben

samt de bägge lösarna I Python. Genom en serie tester har vi kommit fram till att Big Cube har

ett lägre genomsnittligt rotationsantal samt lägre standardavvikelse än Reduction. Reductionmetoden

har däremot ett lägre minimumvärde på antalet rotationer och består av färre

algoritmer. Det bästa tillvägagångssättet vore att kombinera de båda lösningarna.

Place, publisher, year, edition, pages
2013.
Series
Kandidatexjobb CSC, K13016
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-134903OAI: oai:DiVA.org:kth-134903DiVA: diva2:668678
Educational program
Master of Science in Engineering - Computer Science and Technology
Supervisors
Examiners
Available from: 2013-12-13 Created: 2013-12-02 Last updated: 2013-12-13Bibliographically approved

Open Access in DiVA

Benchmarking Rubik’s(6075 kB)2682 downloads
File information
File name FULLTEXT01.pdfFile size 6075 kBChecksum SHA-512
a6c212dca37b56f81d3e6d184526d9872ec4f4a32410279e9e50646112813852f107b9b36df2b04a7949e3e49da23a232bbbbe88a532515e867ca34aab50f861
Type fulltextMimetype application/pdf

Other links

http://www.csc.kth.se/utbildning/kth/kurser/DD143X/dkand13/Group3Johan/final/brolin.echeverria.westermark.final.report.pdf
By organisation
School of Computer Science and Communication (CSC)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 2682 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

urn-nbn

Altmetric score

urn-nbn
Total: 207 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf