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
 [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/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).
7	With 4 cores at 2.5GHz and using less than 3Gb of RAM, Nissy can find an	7	With 4 cores at 2.5GHz and using less than 3Gb of RAM, Nissy can find an
8	optimal solution in less than a minute (18 moves or less) to a few minutes.	8	optimal solution in about a minute on average.
9		9
10	Nissy can also solve many different substeps of Thistlethwaite's algorithm	10	Nissy 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).