/kewb

Non optimal rubik's cube solver using Kociemba's two phase algorithm

Primary LanguageRustMIT LicenseMIT

Kewb

Description

This is a Rubik's cube solver that uses Kociemba's two-phase algorithm. However, please note that this is still a work in progress and the implementation is not yet efficient. The solver does not currently use symmetric reductions, pre-moves, or multi-threaded search.

Usage

By default, there is no timeout, which means the solver will return the first solution it finds. However, by adding a timeout, the solver will continue searching until the timeout has elapsed and return the shortest solution found or nothing. Specifying a lower search depth can result in better solution quality (around 21 to 23 moves), but it can also make the search slower if the depth is less than 20 moves. Nevertheless, it has been proven that all cases can be solved in 20 moves or fewer.

kewb help
kewb solve --scramble "R U R' U'" --max 22 --timeout 1 --details
kewb solve -s "R U R' U'" -m 22 -t 1 -d
# default values: max = 23, timeout = none, details = false
kewb scramble
kewb scramble -n 5
# default values: number = 1
# default values max: 23, timeout: none, details: false

Build

NB: You must have the rust toolchain installed

Clone the repository and run:

cargo build --release # build in target/build/
# or
cargo install --path . # install to ~/.cargo/bin/

Testing

You can run the tests by running:

cargo test --workspace --lib

Todo

  • More CLI features
  • Algorithm optimization
  • Server and webui

References