Update: Added F2LEO and Pseudo F2LEO solvers to the website.

[orcube]

I created C++ programs to solve cross, xcross, xxcross, xxxcross, xxxxcross and last layer. Simple CLI is also available.

CLI testing on Github codespace:

lite vresion of CLI testing on Github codespace:

Simple demo solver for cross, xcross, xxcross and xxxcross: https://or18.github.io/Rubiks-cube-xcross-solver/
Source: https://github.com/or18/Rubiks-cube-xcross-solver

 

[GRVigo]

Hello. Your app looks good, but you should make a graphical interface, using the command line is no longer attractive. I programmed my solver first on the command line and it was the fun part, creating the graphical interface is the most boring part.

 

[orcube]

Hello. Thanks for the feedback. I have just released a new online demo solver. It is based on the lite version of the solver and allows solution search for cross, xcross, xxcross, xxxcross, xxxxcross, last layer substeps and last layer with real-time output.. Please see the video.
Demo: https://or18.github.io/RubiksSolverDemo/
Source: https://github.com/or18/RubiksSolverDemo

 

[orcube]

Added analyzer functions for cross, xcross, xxcross and xxxcross. Click the Analyze button to analyze the solution lengths for all faces and all slot patterns. In each cell of the table, the length of the shortest solution in that condition and the average of the lengths of the first 10 solutions are shown.

 

[orcube]

solver and analyzer for pseudo cross, xcross, xxcross, xxxcross was added to my solver, this can be used like this.

 

[orcube]

I have added pairing solver and pseudo pairing solver. They can solve (pseudo) cross, xcross, xxcross, xxxcross + free (pseudo) pair, and both solvers come with fast analyzers. Each analyzer calculates the shortest solution length and outputs the results in real-time, also added a sorting feature to the table. The analyzer now allows you to select the face to solve. By default, only the D face is selected.

Here are some examples.
1. Solve xcross (BL) and free pair (FL)
See on the solver website
2. Solve adjacent pseudo xxcross (BL FL/BR FR) and free pseudo pair (BR/FL)
See on the solver website
3. 21 moves solve by F2L pairing and LL&AUF solver
See on the solver website
4. 24 moves solve by Pseudo pairing, LL substep and LL&AUF solver
See on the solver website

 

[Deleted member 36445]

hello

this is a really valuable tool!

thanks for helping the cubing community!

 

[orcube]

I just added EOCross solver to my website. This solver can solve EOCross, XEOCross, XXEOCross, and XXXEOCross. The solver also comes with an analyzer to check the shortest moves for the FB and LR cases for each face.

Here are some examples
1: Solve EOCross (FB axis)
2: Solve XEOCross (BL slot, LR case)

 

[orcube]

Slice moves <M, E, S> and wide moves <u, d, l, r, f, b> can now be used for search. The move restrict option has been changed to a checkbox format, allowing users to select the moves from <U, D, L, R, F, B, u, d, l, r, f, b, M, E, S>. Some examples are bellow:

1. Solve XCross using <U, D, R, F, M>
2. Search 1LLL algs using <U, F, r, M>
3. Search VLS algs using <U, R, r>

Additionally, I created 2x2x2 solver, which enables searching algorithms such as CLL and EG.

 

[orcube]

Rotations <x, y, z> can now be used for search. Also, more advanced settings are now available, such as Pre Move and Move Available Table. These advanced settings are stored in URL parameters, making it easy to share configurations. Some examples are bellow:

1. Search solutions for PLL-Aa using <U, D, R, x>
2. Search solutions for PLL-Na using <U, D, R, z>

Additionally, the UI has been updated for improved usability. Solutions can now be easily copied via a modal. Furthermore, Move Restrict has been changed to a selection format from a table.

 

[orcube]

A visual cube‑state editor was added to the solver.
The cube’s state is represented by piece swaps and flips, and the Get Scramble button generates the algorithm for the state.

 

[orcube]

Visual cube editor and advanced search settings have been added to the 2x2x2 solver. Pre-rotation is automatically determined from the DBL corner when generating scrambles, enabling faster solution searches. Rotations <x, y, z> are also now supported. Here are some example settings:

1. Search CLL algs by restricting the number of moves of F, F2, F', R2, and U2.
2. Search EG1 algs with <U, R, F, y> and rotation start setup

 

[orcube]

Update: I've added F2LEO and Pseudo F2LEO solvers to my solver website!

These are built on top of the existing F2L and Pseudo F2L solvers, with an added condition: the Edge Orientation (EO) of the F2L pairs must be oriented correctly (good EO). Both new solvers include analyzers and run very efficiently, requiring only about 50 MB of memory.

I developed these solvers to research efficient techniques for solving up to the 3rd F2L pair in the CFOP and ZB methods.

Main Benefits:

1. Rotationless F2L: After completing F2LEO, no <y> rotations or <FB> moves are needed to finish the rest of the F2L. It also makes pattern recognition for pseudo slotting much easier.
2. Halved Alg Sets: The number of required F2L/ZBLS algorithms is effectively halved.
3. Intuitive Pseudo Multi-Slotting: Since there is no longer a need to consider the EO of the F2L pairs, fast and intuitive pseudo multi-slotting becomes possible.

Insights on Move Count:
The optimal move count is generally only about 1 move longer than the standard optimal solutions for the corresponding (pseudo) Cross, XCross, XXCross, or XXXCross.

• For example, a standard Cross is usually 5-7 moves, whereas a Cross + F2LEO takes about 6-8 moves.
• For context, this is a tier lower than a standard XCross (which typically requires 7-9 moves).

Here are a few examples using the new solvers:
1. Solve Cross + F2LEO
2. Solve XCross + F2LEO
3. Pseudo XCross + F2LEO

 

[Swagrid]

welcome back zz method