Implementation of Kociemba algorithm for solving Rubik's cube.
- Clone project using git panel or console. If you nor familiar with gir, you can simply download ZIP-archive.
git clone https://github.com/dmitryblackwell/RubiksCubeSolver.git
- Setup dependencies (if needed)
Check for jdk setup. It is recommended to use JDK 1.8 or 1.9. To setup jdk go to
File -> Project Structure -> Project -> Project SDK
- Create out folder
Create folder for compiled classed (out by default) and add it to your project structure.
File -> Project Structure -> Project -> Project Compiler output
You can simply run bin/RubiksCubeSolver.jar to see how program work.
To solve just enter your colors to stickers. To do it just click on the color palette and the on sticker. Or just scramble the cube.
Also you can enter your own rotations. Just click enter and type your rotations with capital letters. If you want to get solved cube, just left field empty.
To solve your cube just enter facelets in the GUI. First click a button on color palette and after a sticker, that you want to pain. If you want to scramble cube, click that button. To enter rotations, click enter end type your rotation sequins using spaces. If you left field empty - cube will be solved.
U - up
F - face
R - right
D - down
L - left
B - back
All cube solving process split into two subgroups. In each phase only special moves allowed. Simply program just move cube from start to middle state, and after to solve state, using allowed below moves.
G0 = <U, D, L, R, F, B>
G1 = <U, D, L2, R2, F2, B2>
In phase 1, the algorithm looks for maneuvers which will transform a scrambled cube to G1. That is, the orientations of corners and edges have to be constrained and the edges of the UD-slice have to be transferred into that slice.
In phase 2 the algorithm restores the cube in the subgroup G1, using only moves of this subgroup. It restores the permutation of the 8 corners, the permutation of the 8 edges of the U-face and D-face and the permutation of the 4 UD-slice edges.
The algorithm does not stop when a first solution is found but continues to search for shorter solutions by carrying out phase 2 from suboptimal solutions of phase 1.
In junit folder you can find simple test for Search algorithm. It is randomly scramble cube and then solve it.
Only if cube in it is final state, test is complete successfully.
Simple example of how searching algorithm is called and where.
public class Main extends JFrame {
// ...
private void solveCube() {
String cubeString = getCubeInput();
System.out.println(cubeString);
String result = Search.solution(cubeString);
resultText.setText(result);
rotations = result.split(" ");
index = 0;
System.out.println(Arrays.toString(rotations));
}
}Current version is 1.0.1
For details see SemVer site.
- Dmitry Blackwell - Initial work, Algorithm, GUI. - @dmitryblackwell
This project is licensed under the Apache License 2.0 - see the LICENSE.md file for details.
Apache License 2.0 © @dmitryblackwell