This is an online solver for speedcubers that uses specific methods such as CFOP and ZZ. It is designed to perform solution searches for techniques like cross, X-Cross, and EOCross. Additionally, it supports the search for some algorithms for the last layer. Unlike the solver tool included with the timer, this tool is capable of advanced solution searches.
The following 13 solvers are currently available.
F2L Lite: Lite solver for cross, X-cross, XX-cross, XXX-cross, and XXXX-cross. Analyzer available.
Pairing: Lite solver for a free pair. Analyzer available.
Pseudo F2L Lite: Lite solver for pseudo cross, X-cross, XX-cross, and XXX-cross. Analyzer available.
Pseudo Pairing: Lite solver for a pseudo free pair. Analyzer available.
EOCross: Lite solver for EOCross, X-EOCross, XX-EOCross, XXX-EOCross, and XXXX-EOCross. Analyzer available.
LL Substeps Lite: Lite solver for last layer CP, CO, EP, and EO
LL Lite: Lite solver for last layer
LL AUF Lite: Lite solver for last layer and AUF
Two Phase: Two Phase solver using min2phase.js
F2L: Solver for cross, X-cross, XX-cross, XXX-cross, and XXXX-cross. Recommended for use with PC. Analyzer available.
LL Substeps: Solver for last layer CP, CO, EP, and EO. Recommended for use with PC.
LL: Solver for last layer. Recommended for use with PC.
LL AUF: Solver for last layer and AUF. Recommended for use with PC.
Some solvers come with an analyzer that solves for each pattern one at a time and displays the shortest number of moves in HTM in a table. The numbered cells in this table act as buttons to start the search with that condition. You can click the header to sort the table by its columns. Select the faces to analyze from U, D, L, R, F, and B.
The following table shows the memory requirements for each solver. If memory is insufficient, the web page may crash (resulting in a forced reload). However, as mentioned below, it is possible to recover the page using the query parameter.
Solver | Single Search | Analyzer |
---|---|---|
F2L Lite | 100 MB | 100 MB |
Pairing | 100 MB | 200 MB |
Pseudo F2L Lite | 100 MB | 100 MB |
Pseudo Pairing | 100 MB | 400 MB |
EOCross | 200 MB | 200 MB |
LL Substeps Lite | 100 MB | - |
LL Lite | 100 MB | - |
LL AUF Lite | 100 MB | - |
F2L | 1.6 GB | 100 MB |
LL Substeps | 1.6 GB | - |
LL | 1.6 GB | - |
LL AUF | 1.6 GB | - |
The scramble is saved in a temporary array each time Scramble is edited. You can navigate to the previous or next input in the history by pressing the [⬅️] or [➡️] button. If there is no previous or next history, the corresponding button will not appear.
Pressing the [Reverse] button reverses the alg of each row and sorts them in reverse order.
Pressing the [Mirror] button mirrors the alg of each row.
Pressing the [Random] button generates a random scramble using min2phase.js. The generated scramble is automatically annotated with the comment by “// setup”.
After configuring the appropriate settings, you can start the search by pressing the [Start] button. While the search is in progress, the [Start] button will change to an [End] button, which you can press to stop the search.
Each time a solution is found, a Details section will be created that includes an [Add] button, a Twisty Player, and various links, with the output being updated in real time. By pressing the [Add] button, you can add the solution to the Scramble.
Whenever the input fields are updated, the query parameters will also be updated. If a search is performed, the first solution will be added to the query parameters.
In rare cases, functions exported by Emscripten may not be initialized properly (especially on mobile devices). In such cases, a warning will be displayed, and you will be prompted to reload the page manually.
Rotation: Select a rotation alg before starting the search.
Slot: Select F2L slots from BL (Back Left), BR (Back Right), FR (Front Right), and FL (Front Left). If none of the four slots are selected, meaning None is chosen, it will function as cross solver.
Free Pair: Select a slot for solving the free pair from the slots other than the one selected in the Slot.
Pseudo Slot Edge: Select slot edges from BL, BR, FR, and FL. If none of the four slots are selected, meaning None is chosen, it will function as a pseudo cross solver, which solves cross when D face misalignment is allowed.
Pseudo Slot Corner: Select slot edges from BL, BR, FR, and FL. Dropbox for this will appear when anything other than None is selected for Pseudo Slot Edge.
Free Pair Edge: Select a pseudo slot edge for solving the pseudo free pair from the slots other than the one selected in the Pseudo Slot Edge.
Free Pair Corner: Select a pseudo slot corner for solving the pseudo free pair from the slots other than the one selected in the Pseudo Slot Corner.
Last Layer Option: Select from CP, CO, EP, and EO. If none of these options are selected, meaning None is chosen, it will function as XXXX-cross solver.
Max Length: The maximum number of moves in HTM for the solution to be searched.
Max Count: The maximum number of solutions to be searched.
A set of solvers for Rubik’s Cube cross, X-cross, XX-cross, XXX-cross, and XXXX-cross. It is used to search solutions for cross, X-cross, F2L, multi-slotting, and more. The F2L solver can perform the same search. Here are some examples.
Search solutions for yellow cross. [See on the website]
Search solutions for white cross, when selecting a rotation alg from the Rotation. [See on the website]
Search solutions for white cross, when input a rotation alg in the Scramble. [See on the website]
Search solutions for white X-cross. [See on the website]
Search solutions for 1st F2L, setting Move Restrict to URF. [See on the website]
Search solutions for white XX-cross. [See on the website]
Search solutions for white XXX-cross. [See on the website]
Search solutions for white XXXX-cross (F2L skip). [See on the website]
Search solutions for last two F2L slots, setting Move Restrict to URF. [See on the website]
A set of solvers for a free pair. It is used to search solutions for cross with a free pair, advanced F2L setup, and more. Here are some examples.
Search solutions for cross with a free pair. [See on the website]
Search solutions for 3rd F2L and last pair, setting Move Restrict to URF. [See on the website]
A set of solvers for pseudo cross, X-cross, XX-cross, and XXX-cross. It is used to search solutions for pseudo X-cross, pseudo slotting, and more. Here are some examples.
Search solutions for pseudo X-cross. [See on the website]
Search solutions for adjecent pseudo XX-cross. [See on the website]
Search solutions for diagonal pseudo XX-cross. [See on the website]
A set of solvers for a pseudo free pair. It is used to search solutions for pseudo cross with a pseudo free pair, some advanced pseudo slotting, and more. Here are some examples.
Search solutions for pseudo cross with a pseudo free pair. [See on the website]
Search solutions for 3rd pseudo slot and last pseudo pair, setting Move Restrict to UDR. [See on the website]
A set of solvers for EOcross, X-EOcross, XX-EOcross, XXX-EOcross, and XXXX-EOCross. Here are some examples.
Search solutions for EOCross (LR). [See on the website]
Search solutions for EOCross (FB). [See on the website]
Search solutions for X-EOCross (LR). [See on the website]
Search solutions for XX-EOCross (FB). [See on the website]
A solver for last layer CP, CO, EP, and EO. It is used to search solutions for OLL, COLL, ZBLS, and more. The LL Substeps solver can perform the same search.
Search solutions for OLL, setting Move Restrict to URF. [See on the website]
Search solutions for ZBLS, setting Move Restrict to URF. [See on the website]
Search solutions for COLL, setting Move Restrict to URF. [See on the website]
A solver for last layer. Note that AUF can remain. It is used to search solutions for PLL, 2GLL, ZBLL, 1LLL, and more Here are some examples. The LL solver can perform the same search.
Search solutions for PLL, setting Move Restrict to URF. [See on the website]
Search solutions for 2GLL, setting Move Restrict to UR. [See on the website]
A solver for last layer and AUF. The LL AUF solver can perform the same search. It is recommended to use LL Lite or LL solver.