HackerPapers

arXiv:0803.3435cs.SC

Twenty-Five Moves Suffice for Rubik's Cube

Tomas Rokicki

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

How many moves does it take to solve Rubik's Cube? Positions are known that require 20 moves, and it has already been shown that there are no positions that require 27 or more moves; this is a surprisingly large gap. This paper describes a program that is able to find solutions of length 20 or less at a rate of more than 16 million positions a second. We use this program, along with some new ideas and incremental improvements in other techniques, to show that there is no position that requires 26 moves.

arXiv comments
Journal reference
DOI
Subjects
cs.SCSymbolic Computation cs.DMDiscrete Mathematics

On Hacker News

No comments linking this paper were found in the collected sources. Found in 2 HN submissions from Jun 2008 to Jun 2018. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.