aboutsummaryrefslogtreecommitdiff
path: root/README.md
diff options
context:
space:
mode:
authorSebastiano Tronto <sebastiano.tronto@gmail.com>2021-12-28 12:47:01 +0100
committerSebastiano Tronto <sebastiano.tronto@gmail.com>2021-12-28 12:47:01 +0100
commitdc4efd2b5bff43a5a040e73e6e534a145a6b1fb2 (patch)
tree7356e7a83827c8c484195ceec68fc97ef5a2e16f /README.md
parent998a5036fe2c9aa1ceb047663be6ad9a2063b88d (diff)
downloadnissy-dc4efd2b5bff43a5a040e73e6e534a145a6b1fb2.tar.gz
nissy-dc4efd2b5bff43a5a040e73e6e534a145a6b1fb2.zip
Changed time estimate for optimal solving (after running a test on 100 scrambles).
Diffstat (limited to 'README.md')
-rw-r--r--README.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/README.md b/README.md
index 6166852..88c0dbb 100644
--- a/README.md
+++ b/README.md
@@ -5,7 +5,7 @@ For optimal HTM solving Nissy uses techniquest from Herbert Kociemba's
5[Cube Explorer](http://kociemba.org/cube.htm) and Tomas Rokicki's 5[Cube Explorer](http://kociemba.org/cube.htm) and Tomas Rokicki's
6[nxopt](https://github.com/rokicki/cube20src/blob/master/nxopt.md). 6[nxopt](https://github.com/rokicki/cube20src/blob/master/nxopt.md).
7With 4 cores at 2.5GHz and using less than 3Gb of RAM, Nissy can find an 7With 4 cores at 2.5GHz and using less than 3Gb of RAM, Nissy can find an
8optimal solution in less than a minute (18 moves or less) to a few minutes. 8optimal solution in about a minute on average.
9 9
10Nissy can also solve many different substeps of Thistlethwaite's algorithm 10Nissy can also solve many different substeps of Thistlethwaite's algorithm
11(DR/HTR), and can use NISS (Normal-Inverse Scramble Switch). 11(DR/HTR), and can use NISS (Normal-Inverse Scramble Switch).

Generated with cgit - Back to sebastiano.tronto.net