nissy-nx

A Rubik's cube optimal solver
git clone https://git.tronto.net/nissy-nx
Download | Log | Files | Refs | README | LICENSE

commit dc4efd2b5bff43a5a040e73e6e534a145a6b1fb2
parent 998a5036fe2c9aa1ceb047663be6ad9a2063b88d
Author: Sebastiano Tronto <sebastiano.tronto@gmail.com>
Date:   Tue, 28 Dec 2021 12:47:01 +0100

Changed time estimate for optimal solving (after running a test on 100 scrambles).

Diffstat:
MREADME.md | 2+-
Mdoc/nissy.1 | 2+-
2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/README.md b/README.md @@ -5,7 +5,7 @@ For optimal HTM solving Nissy uses techniquest from Herbert Kociemba's [Cube Explorer](http://kociemba.org/cube.htm) and Tomas Rokicki's [nxopt](https://github.com/rokicki/cube20src/blob/master/nxopt.md). With 4 cores at 2.5GHz and using less than 3Gb of RAM, Nissy can find an -optimal solution in less than a minute (18 moves or less) to a few minutes. +optimal solution in about a minute on average. Nissy can also solve many different substeps of Thistlethwaite's algorithm (DR/HTR), and can use NISS (Normal-Inverse Scramble Switch). diff --git a/doc/nissy.1 b/doc/nissy.1 @@ -17,7 +17,7 @@ is a Rubik's Cube solver. It uses techniques from Herbert Kociemba's Cube Explorer and Tomas Rokicki's nxopt. With 4 cores at 2.5GHz and using less than 3Gb of RAM, Nissy can find the optimal solution for a random Rubik's cube position -in less than a minute (18 moves or less) to a few minutes. +in about a minute on average. Nissy can also solve different substeps of the Thistlethwaite's algorithm and more. .Pp When run without any argument an interactive shell is launched, otherwise