nissy

Where is nissy?
git clone https://git.tronto.net/nissy
Download | Log | Files | Refs | README

commit 036195651f74ae1707e4b5991e3d2252da7e1531
parent 8946d2991a9271861f02f352270b05f7fe7c41fe
Author: Sebastiano Tronto <sebastiano@tronto.net>
Date:   Wed,  1 Jun 2022 17:13:29 +0200

General cleanup, in preparation for new release

Diffstat:
MMakefile | 2+-
MREADME.md | 2+-
MTODO.md | 17+++++++++--------
Mdoc/nissy.1 | 4++--
Msrc/shell.c | 4+---
Mwww/index.html | 2+-
6 files changed, 15 insertions(+), 16 deletions(-)

diff --git a/Makefile b/Makefile @@ -1,6 +1,6 @@ # See LICENSE file for copyright and license details. -VERSION = 2.1-current +VERSION = 2.0.2 PREFIX = /usr/local MANPREFIX = ${PREFIX}/share/man diff --git a/README.md b/README.md @@ -4,7 +4,7 @@ A Rubik's cube solver and FMC assistant. For optimal HTM solving Nissy uses techniques 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 +With 4 cores at 2.5GHz and using about 3Gb of RAM, Nissy can find an optimal solution in about a minute on average. Nissy can also solve many different substeps of Thistlethwaite's algorithm diff --git a/TODO.md b/TODO.md @@ -4,14 +4,9 @@ This is a list of things that I would like to add or change at some point. It's more of a personal reminder than anything else. ## Version 2.0.2 -* General idea: only improvement on generating pruning tables, no new - commands or anything else -### Tables management -* Check files in tables directory, add command to remove old / extraneous files -* Add checksum to check that tables are generated / downloaded correctly -### Documentation -* Write an examples.md file -* More screenshots! +### Changelog +* Only improved table generation speed, but this required huge changes in + coordinates.c and symcoord.c (+ some minor changes in other parts). ## For version 2.1 ### Coordinates @@ -43,6 +38,12 @@ It's more of a personal reminder than anything else. ### Loading at startup vs dynamically * Consider moving more things to the initial loading phase (i.e. remove many of the "initialized" parts) +### Documentation +* Write an examples.md file +* More screenshots! +### Tables management +* Check files in tables directory, add command to remove old / extraneous files +* Add checksum to check that tables are generated / downloaded correctly ## Commands diff --git a/doc/nissy.1 b/doc/nissy.1 @@ -16,7 +16,7 @@ .Nm 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 +Tomas Rokicki's nxopt. With 4 cores at 2.5GHz and using about 3Gb of RAM, Nissy can find the optimal solution for a random Rubik's cube position in about a minute on average. Nissy can also solve different substeps of the Thistlethwaite's algorithm and more. @@ -264,7 +264,7 @@ The file will look something like this: .Dl D\(aq F R\(aq D B L2 B R2 L U L U2 B D\(aq U R U F2 (18) . .Sh AUTHORS -.An Sebastiano Tronto Aq Mt sebastiano.tronto@gmail.com +.An Sebastiano Tronto Aq Mt sebastiano@tronto.net . .Sh SOURCE CODE Source code is available at diff --git a/src/shell.c b/src/shell.c @@ -148,9 +148,7 @@ main(int argc, char *argv[]) fprintf(stderr, "--- Warning ---\n" "Some pruning tables are missing or unreadable\n" - "You can generate them with `nissy gen -t 4'\n" - "Here `4' is the number of threads. Use more if your " - "CPU has them, or expect it to take a while.\n" + "You can generate them with `nissy gen'.\n" "---------------\n\n" ); } diff --git a/www/index.html b/www/index.html @@ -36,7 +36,7 @@ for random positions using techniques from Herbert Kociemba's <a href="http://kociemba.org/cube.htm">Cube Explorer</a> and Tomas Rokicki's <a href="https://github.com/rokici/cube20src/blob/master/nxopt.md">nxopt</a>. -With 4 cores at 2.5GHz and using less than 3Gb of RAM, Nissy can find an optimal +With 4 cores at 2.5GHz and using about 3Gb of RAM, Nissy can find an optimal solution in about a minute on average. </p>