Solving Full N×N×N Rubik’s Supercube Using Genetic Algorithm
The article presents an algorithm that uses an evolutionary approach to the problem of solving the Full Rubik N×N×N Supercube, i.e., the orientation of all cubies, including the internal ones, not only according to face colors but to the same orientation in 3D space. The problem is formally defined...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2023-01-01
|
| Series: | International Journal of Computer Games Technology |
| Online Access: | http://dx.doi.org/10.1155/2023/2445335 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | The article presents an algorithm that uses an evolutionary approach to the problem of solving the Full Rubik N×N×N Supercube, i.e., the orientation of all cubies, including the internal ones, not only according to face colors but to the same orientation in 3D space. The problem is formally defined by the matrix representation using affine cubies transforms. The Full Supercube’s solving strategy uses a series of genetic algorithms that try to find a better cube configuration than the current one. Once found, movements are made to change the current configuration. This strategy is repeated until the cube is solved. The genetic algorithm limits the movements to the current cluster by solving the cube in stages, outwards from the center of the cube. The movements that solve the clusters are saved as macros and used to train and speed up the algorithm. The purpose of the presented algorithm is to minimize the solution time and not necessarily the number of moves. |
|---|---|
| ISSN: | 1687-7055 |