aboutsummaryrefslogtreecommitdiff
path: root/doc
diff options
context:
space:
mode:
authorSebastiano Tronto <sebastiano@tronto.net>2022-02-13 13:57:27 +0100
committerSebastiano Tronto <sebastiano@tronto.net>2022-02-13 13:57:27 +0100
commit84ac5f52efc9bc13fd1d3bd18991b1667aaf0413 (patch)
tree3256a711dbb8690cda8ce670196ecaa7eb689a52 /doc
parent97c9dba402d6d4097cbdc4c44c00222c53122033 (diff)
downloadnissy-84ac5f52efc9bc13fd1d3bd18991b1667aaf0413.tar.gz
nissy-84ac5f52efc9bc13fd1d3bd18991b1667aaf0413.zip
Small makefile changes, fixed todo list
Diffstat (limited to 'doc')
-rw-r--r--doc/nissy.html18
-rw-r--r--doc/nissy.pdfbin33153 -> 33152 bytes
2 files changed, 8 insertions, 10 deletions
diff --git a/doc/nissy.html b/doc/nissy.html
index e51aa07..ed73e37 100644
--- a/doc/nissy.html
+++ b/doc/nissy.html
@@ -1,5 +1,5 @@
1<!-- Creator : groff version 1.22.4 --> 1<!-- Creator : groff version 1.22.4 -->
2<!-- CreationDate: Wed Dec 29 17:47:39 2021 --> 2<!-- CreationDate: Sun Feb 13 13:56:11 2022 -->
3<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" 3<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"
4"http://www.w3.org/TR/html4/loose.dtd"> 4"http://www.w3.org/TR/html4/loose.dtd">
5<html> 5<html>
@@ -29,10 +29,9 @@ Rubik&rsquo;s cube solver and FMC assistant</p>
29 29
30<p style="margin-top: 1em"><b>SYNOPSIS</b></p> 30<p style="margin-top: 1em"><b>SYNOPSIS</b></p>
31 31
32<p style="margin-left:6%;">[<b>&minus;b</b>]</p> 32<p style="margin-left:14%;"><b>nissy</b> [<b>&minus;b</b>]
33 33<b><br>
34<p style="margin-left:14%;"><b>nissy</b> <i>command</i> 34nissy</b> <i>command</i> [options...]</p>
35[options...]</p>
36 35
37<p style="margin-top: 1em"><b>DESCRIPTION</b></p> 36<p style="margin-top: 1em"><b>DESCRIPTION</b></p>
38 37
@@ -181,11 +180,10 @@ solutions that require the minimum number of moves.</p>
181 180
182<p style="margin-left:27%; margin-top: 1em">Only find 181<p style="margin-left:27%; margin-top: 1em">Only find
183solutions that require at most <i>N</i> moves more than the 182solutions that require at most <i>N</i> moves more than the
184optimal solution. If <i>N</i> is 0, this is equivalent 183optimal solution. If <i>N</i> is 0, this is equivalent to
185to</p> 184<b>&minus;o</b></p>
186 185
187<p style="margin-top: 1em"><b>&minus;o <br> 186<p style="margin-top: 1em"><b>&minus;p</b></p>
188&minus;p</b></p>
189 187
190<p style="margin-left:27%; margin-top: 1em">Plain style: do 188<p style="margin-left:27%; margin-top: 1em">Plain style: do
191not print the number of moves.</p> 189not print the number of moves.</p>
@@ -310,7 +308,7 @@ D' F R' D B L2 B R2 L U L U2 B D' U R U F2 (18)</p>
310<b>https://github.com/sebastianotronto/nissy</b></p> 308<b>https://github.com/sebastianotronto/nissy</b></p>
311 309
312<p style="margin-left:6%; margin-top: 1em">BSD 310<p style="margin-left:6%; margin-top: 1em">BSD
313December&nbsp;29, 2021 BSD</p> 311February&nbsp;13, 2022 BSD</p>
314<hr> 312<hr>
315</body> 313</body>
316</html> 314</html>
diff --git a/doc/nissy.pdf b/doc/nissy.pdf
index fa71758..be8433e 100644
--- a/doc/nissy.pdf
+++ b/doc/nissy.pdf
Binary files differ

Generated with cgit - Back to sebastiano.tronto.net