Skip to content
Multithreaded brute force Rubix Cube solver
Branch: master
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Type Name Latest commit message Commit time
Failed to load latest commit information.


Multithreaded recursive brute force Rubix Cube solver

Finds the minimal number of moves to solve a Rubix cube utilizing a binomial heap.

Written fully by hand in Rust.

Only use of non-standard library is a single call to generate a random number.

The notation used is


Rust tool chain. Install with

curl -sSf | sh

To run

From base directory of project

cargo build --release
time target/release/cube

Example Outputs

Output 1 Output 2 Output 3

You can’t perform that action at this time.