This updated and revised edition of David Joyner's entertaining “hands-on” tour of group
theory and abstract algebra brings life, levity, and practicality to the topics through …

We give an expository account of our computational proof that every position of the Rubik's
Cube can be solved in 20 moves or fewer, where a move is defined as any twist of any face …

Rubik's Cube (RC) is a well-known and computationally challenging puzzle that has
motivated AI researchers to explore efficient alternative representations and problem-solving …

Abstract Solutions calculated by Evolutionary Algorithms have come to surpass exact
methods for solving various problems. The Rubik's Cube multiobjective optimization …

The number of moves required to solve any configuration of Rubik's cube has held a
fascination for over 25 years. A new upper bound of 26 is produced. More important, a new …

The most common application of graph theory is search problems. Using graph theory, this
project aims to solve one such NP-hard problem, ie, finding a path for a Rubik's cube to …

This is a tale of two problems. For years, Tom Rokicki worked to determine the exact value of
God's number for the Rubik's Cube (the smallest number of moves needed to solve the cube …

Rubik's cube is considered to be the most challenging puzzle developed for humans.
Building a robot to solve such a puzzle is a challenging task. In this paper, the design of …

Rubik's Cube is an easily-understood puzzle, which is originally called the" magic cube". It is
a well-known planning problem, which has been studied for a long time. Yet many simple …

Optimally solving a given Rubik's Cube is an extremely hard task even for a computer
assuming the immense size of the problem space. In 1997 Korf presented a work that first …