Novel Approach to Solve Rubik’s Cube Using Advanced Fridrich CFOP Algorithm
Ayushi Desai, Aniket Brahmecha, Riya Bhagat, Aparna Halbe
Abstract
Ayushi Desai, Aniket Brahmecha, Riya Bhagat, Aparna Halbe
Abstract
A Rubik's cube consists of six sides made up of 26 cubelets having colored stickers on 1, 2 or 3 sides (54 in all), called center (6), edge (12), and corner (8) pieces, maintaining the Western color scheme of the cube. The 6 center pieces of each side are held together at the core of the cube and provide the mechanism with which each side of the cube can be rotated. Out of the 43 quintillion possible combinations of a 3*3*3 cube, only one state in which all the same colored stickers are on the same sides of the cube, is known as the solved state of the cube. It is a great challenge to achieve the solved state even with the human brain. Remembering all the steps of a particular algorithm is very tedious but can give the desired results. Hence, the Advanced Fridrich CFOP algorithm is implemented to solve the Rubik's cube by querying a database that contains all the possible positions of the cubelets. At each step of the algorithm, the database containing separate tables for each step returns the moves to complete that step towards solving the cube. In the end, a comparison is provided between the Fridrich and the Layer-by-Layer (LBL) algorithm.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A Rubik's cube consists of six sides made up of 26 cubelets having colored stickers on 1, 2 or 3 sides (54 in all), called center (6), edge (12), and corner (8) pieces, maintaining the Western color scheme of the cube. The 6 center pieces of each side are held together at the core of the cube and provide the mechanism with which each side of the cube can be rotated. Out of the 43 quintillion possible combinations of a 3*3*3 cube, only one state in which all the same colored stickers are on the same sides of the cube, is known as the solved state of the cube. It is a great challenge to achieve the solved state even with the human brain. Remembering all the steps of a particular algorithm is very tedious but can give the desired results. Hence, the Advanced Fridrich CFOP algorithm is implemented to solve the Rubik's cube by querying a database that contains all the possible positions of the cubelets. At each step of the algorithm, the database containing separate tables for each step returns the moves to complete that step towards solving the cube. In the end, a comparison is provided between the Fridrich and the Layer-by-Layer (LBL) algorithm.
Key concepts: Cube (algebra), Algorithm, Computer science, Data cube, Colored, State (computer science), Enhanced Data Rates for GSM Evolution, Layer (electronics)