diff options
Diffstat (limited to 'docs')
| -rw-r--r-- | docs/add.txt | 18 | ||||
| -rw-r--r-- | docs/change.txt | 21 | ||||
| -rw-r--r-- | docs/dr.txt | 45 | ||||
| -rw-r--r-- | docs/drcorners.txt | 34 | ||||
| -rw-r--r-- | docs/drfinish.txt | 29 | ||||
| -rw-r--r-- | docs/eo.txt | 38 | ||||
| -rw-r--r-- | docs/exit.txt | 9 | ||||
| -rw-r--r-- | docs/help.txt | 15 | ||||
| -rw-r--r-- | docs/htr.txt | 30 | ||||
| -rw-r--r-- | docs/htrfinish.txt | 23 | ||||
| -rw-r--r-- | docs/invert.txt | 14 | ||||
| -rw-r--r-- | docs/nissy.txt | 88 | ||||
| -rw-r--r-- | docs/pic.txt | 20 | ||||
| -rw-r--r-- | docs/pre.txt | 18 | ||||
| -rw-r--r-- | docs/print.txt | 19 | ||||
| -rw-r--r-- | docs/quit.txt | 9 | ||||
| -rw-r--r-- | docs/replace.txt | 22 | ||||
| -rw-r--r-- | docs/save.txt | 22 | ||||
| -rw-r--r-- | docs/solve.txt | 33 | ||||
| -rw-r--r-- | docs/unniss.txt | 14 |
20 files changed, 521 insertions, 0 deletions
diff --git a/docs/add.txt b/docs/add.txt new file mode 100644 index 0000000..af1f079 --- /dev/null +++ b/docs/add.txt | |||
| @@ -0,0 +1,18 @@ | |||
| 1 | |||
| 2 | HELP PAGE FOR COMMAND add | ||
| 3 | |||
| 4 | SYNTAX | ||
| 5 | add [MOVES|$ID1|@ID1] $ID2 | ||
| 6 | |||
| 7 | DESCRIPTION | ||
| 8 | Appends either MOVES, the scramble memorized under $ID1 or the output sequence | ||
| 9 | memorized under @ID1 at the end of the scramble memorized under $ID2. If none | ||
| 10 | of MOVES, $ID1 or @ID1 is specified, the user will be asked to type the moves. | ||
| 11 | Menmonic: "add x to y" or just "add to y". | ||
| 12 | |||
| 13 | EXAMPLES | ||
| 14 | add $1 | ||
| 15 | The user is required to type the moves that will be appended to $1. | ||
| 16 | add F R B $1 | ||
| 17 | Appends the moves F R B to scramble $1. Now scramble $1 ends with F R B. | ||
| 18 | |||
diff --git a/docs/change.txt b/docs/change.txt new file mode 100644 index 0000000..b6bba0e --- /dev/null +++ b/docs/change.txt | |||
| @@ -0,0 +1,21 @@ | |||
| 1 | |||
| 2 | HELP PAGE FOR COMMAND change | ||
| 3 | |||
| 4 | SYNTAX | ||
| 5 | change $ID1 [MOVES|$ID2|@ID2] | ||
| 6 | |||
| 7 | DESCRIPTION | ||
| 8 | Changes the scramble $ID1 to either MOVES, the scramble $ID2, the output @ID2 | ||
| 9 | or, if none is specified, the moves entered by the user. The scramble that was | ||
| 10 | memorized under $ID1 is then lost. | ||
| 11 | Mnemonic: "change x to y", or just "change x". | ||
| 12 | |||
| 13 | EXAMPLES | ||
| 14 | change $1 | ||
| 15 | The user is required to type the moves that will replace $1. | ||
| 16 | change $2 $3 | ||
| 17 | Saves the scramble that was saved under $3 in $2. Now $2 and $3 are the same | ||
| 18 | scrambles, and the old $2 is lost. | ||
| 19 | change $1 U R | ||
| 20 | Saves U R as scramble $1. | ||
| 21 | |||
diff --git a/docs/dr.txt b/docs/dr.txt new file mode 100644 index 0000000..ddbd9aa --- /dev/null +++ b/docs/dr.txt | |||
| @@ -0,0 +1,45 @@ | |||
| 1 | |||
| 2 | HELP PAGE FOR COMMAND dr | ||
| 3 | |||
| 4 | SYNTAX | ||
| 5 | dr [OPTIONS] [MOVES|$ID|@ID] | ||
| 6 | |||
| 7 | DESCRIPTION | ||
| 8 | Solves DR for a given scramble. A scramble can be given as last argument of the | ||
| 9 | command, or an ID of a saved scramble can be provided. If none of the two is | ||
| 10 | given, a prompt will ask the user to input a new scramble. | ||
| 11 | If the option "from" is given (see below), it solves DR from an EO (if edges | ||
| 12 | are oriented) without breaking that EO. | ||
| 13 | The first time this command is called without the option from (and, to some | ||
| 14 | extent, also the first time it is called with the option from), nissy loads | ||
| 15 | some pruning tables that were not loaded on startup, causing a small but | ||
| 16 | noticeable delay. | ||
| 17 | |||
| 18 | OPTIONS | ||
| 19 | axis={fb,rl,ud} Specify the axis for the DR. One to three axes can be given, | ||
| 20 | comma separated, no spaces. | ||
| 21 | Default: DR on any of the three axis (omitting the option is | ||
| 22 | the same as specifying axis=fb,rl,ud). | ||
| 23 | b=N Specify a bound for the number of moves. N must be a number. | ||
| 24 | Default value: 20. | ||
| 25 | h Show hidden DRs. | ||
| 26 | Default, if an DR ending in e.g. R is shown, the equivalent | ||
| 27 | one ending in R' is hidden. | ||
| 28 | from {fb|rl|ud} Solve DR from the specified EO, which must be solved, | ||
| 29 | without breaking the EO. | ||
| 30 | niss Use NISS. It works only if solving DR from EO. | ||
| 31 | Default: does not use NISS. | ||
| 32 | n=N Specify a maximum number of EOs to be output. N must be a | ||
| 33 | number. | ||
| 34 | Default value: 1. | ||
| 35 | |||
| 36 | EXAMPLES | ||
| 37 | dr from rl axis=ud $1 | ||
| 38 | Finds optimal DR on ud, starting from EO on rl, for the first saved scramble. | ||
| 39 | |||
| 40 | dr niss from fb n=10 m=6 F2 R L B' F D U' R2 L' F D B | ||
| 41 | Finds up to 10 DRs of length at most 6 from EO on fb, possibly using NISS. | ||
| 42 | |||
| 43 | dr n=100 axis=ud h | ||
| 44 | Finds 100 DRs on ud, including "hidden" DRs. | ||
| 45 | |||
diff --git a/docs/drcorners.txt b/docs/drcorners.txt new file mode 100644 index 0000000..8eb9729 --- /dev/null +++ b/docs/drcorners.txt | |||
| @@ -0,0 +1,34 @@ | |||
| 1 | |||
| 2 | HELP PAGE FOR COMMAND drcorners | ||
| 3 | |||
| 4 | SYNTAX | ||
| 5 | drcorners [OPTIONS] [MOVES|$ID|@ID] | ||
| 6 | |||
| 7 | DESCRIPTION | ||
| 8 | Similar to drfinish, but only solves corners. CO must be solved. The scramble | ||
| 9 | can be given as the last argument of the command, or it may be given as an $ID | ||
| 10 | or @ID, or it can be typed out on the following line. | ||
| 11 | |||
| 12 | OPTIONS | ||
| 13 | from {ud|fb|rl} Allows to specify on which axis the CO is solved. It is | ||
| 14 | usually not necessary, since nissy will find a CO on any | ||
| 15 | axis. | ||
| 16 | i Ignores E-layer centers. By default cornersare solved | ||
| 17 | relatively to centers; this options allows for solutions | ||
| 18 | which solve corners relatively to each other and to the | ||
| 19 | U and D sides, but not to the E layer (or any equivalent | ||
| 20 | if the CO is not on U/D). | ||
| 21 | b=N Specify a bound for the number of moves. N must be a number. | ||
| 22 | Default value: 20. | ||
| 23 | n=N Specify a maximum number of solutions to be output. N must | ||
| 24 | be a number. | ||
| 25 | Default value: 1. | ||
| 26 | |||
| 27 | EXAMPLES | ||
| 28 | drcorners n=3 R' D R2 D' R' U2 R D R' U2 R' D' R | ||
| 29 | Produces the following output: | ||
| 30 | Found 3 results. | ||
| 31 | @1: U' F2 U R2 U2 F2 U F2 U R2 (10) | ||
| 32 | @2: U' F2 U R2 U2 B2 U R2 D R2 (10) | ||
| 33 | @3: U' F2 U R2 U2 B2 U L2 U L2 (10) | ||
| 34 | |||
diff --git a/docs/drfinish.txt b/docs/drfinish.txt new file mode 100644 index 0000000..efd12ac --- /dev/null +++ b/docs/drfinish.txt | |||
| @@ -0,0 +1,29 @@ | |||
| 1 | |||
| 2 | HELP PAGE FOR COMMAND drfinish | ||
| 3 | |||
| 4 | SYNTAX | ||
| 5 | drfinish [OPTIONS] [MOVES|$ID|@ID] | ||
| 6 | |||
| 7 | DESCRIPTION | ||
| 8 | Solves the given scramble using the DR moveset. DR must be solved. The scramble | ||
| 9 | can be given as the last argument of the command, or it may be given as an $ID | ||
| 10 | or @ID, or it can be typed out on the following line. | ||
| 11 | |||
| 12 | OPTIONS | ||
| 13 | from {ud|fb|rl} Allows to specify on which axis the DR is solved. It is | ||
| 14 | usually not necessary, since nissy will find a DR on any | ||
| 15 | axis, but it can be useful if one want to e.g. solve an HTR | ||
| 16 | state allowing quarter-turns from a specific DR. | ||
| 17 | b=N Specify a bound for the number of moves. N must be a number. | ||
| 18 | Default value: 20. | ||
| 19 | n=N Specify a maximum number of solutions to be output. N must | ||
| 20 | be a number. | ||
| 21 | Default value: 1. | ||
| 22 | |||
| 23 | EXAMPLES | ||
| 24 | dr from ud R L' U2 R' L F2 | ||
| 25 | Solves the given scramble using the moveset <U,D,R2,L2,F2,B2>. In this case: | ||
| 26 | @1: U2 R2 F2 R2 U2 R2 F2 R2 (8) | ||
| 27 | drfinish b=7 n=10 $1 | ||
| 28 | Finds (at most) 10 solutions of length at most 7 for the scramble $1. | ||
| 29 | |||
diff --git a/docs/eo.txt b/docs/eo.txt new file mode 100644 index 0000000..603c189 --- /dev/null +++ b/docs/eo.txt | |||
| @@ -0,0 +1,38 @@ | |||
| 1 | |||
| 2 | HELP PAGE FOR COMMAND eo | ||
| 3 | |||
| 4 | SYNTAX | ||
| 5 | eo [OPTIONS] [MOVES|$ID|@ID] | ||
| 6 | |||
| 7 | DESCRIPTION | ||
| 8 | Solves EO for a given scramble. A scramble can be given as last argument of the | ||
| 9 | command, or an ID of a saved scramble can be provided. If none of the two is | ||
| 10 | given, a prompt will ask the user to input a new scramble. | ||
| 11 | |||
| 12 | OPTIONS | ||
| 13 | axis={fb,rl,ud} Specify the axis for the EO. One to three axes can be given, | ||
| 14 | comma separated, no spaces. | ||
| 15 | Default: EO on any of the three axis (omitting the option is | ||
| 16 | the same as specifying axis=fb,rl,ud). | ||
| 17 | b=N Specify a bound for the number of moves. N must be a number. | ||
| 18 | Default value: 20. | ||
| 19 | h Show hidden EOs. | ||
| 20 | Default, if an EO ending in e.g. F is shown, the equivalent | ||
| 21 | one ending in F' is hidden. | ||
| 22 | niss Use NISS. | ||
| 23 | Default: does not use NISS. | ||
| 24 | n=N Specify a maximum number of EOs to be output. N must be a | ||
| 25 | number. | ||
| 26 | Default value: 1. | ||
| 27 | |||
| 28 | EXAMPLES | ||
| 29 | eo axis=fb $1 | ||
| 30 | Finds one optimal EO on fb for the first saved scramble. | ||
| 31 | |||
| 32 | eo n=5 b=4 U R F | ||
| 33 | Finds up to 5 EOs of length at most 4 for scramble U R F. | ||
| 34 | |||
| 35 | eo n=100 b=5 niss axis=fb,ud h R' U' F L R'U'F | ||
| 36 | Finds up to 100 EOs of lenth at most 4, possibly using NISS, including | ||
| 37 | "hidden" EOs, excluding the rl axis. | ||
| 38 | |||
diff --git a/docs/exit.txt b/docs/exit.txt new file mode 100644 index 0000000..fb3d8f5 --- /dev/null +++ b/docs/exit.txt | |||
| @@ -0,0 +1,9 @@ | |||
| 1 | |||
| 2 | HELP PAGE FOR COMMAND exit | ||
| 3 | |||
| 4 | SYNTAX | ||
| 5 | exit | ||
| 6 | |||
| 7 | DESCRIPTION | ||
| 8 | Exits nissy. | ||
| 9 | |||
diff --git a/docs/help.txt b/docs/help.txt new file mode 100644 index 0000000..6eeaa75 --- /dev/null +++ b/docs/help.txt | |||
| @@ -0,0 +1,15 @@ | |||
| 1 | |||
| 2 | HELP PAGE FOR COMMAND help | ||
| 3 | |||
| 4 | SYNTAX | ||
| 5 | help [nissy|COMMAND] | ||
| 6 | |||
| 7 | DESCRIPTION | ||
| 8 | 'help nissy' prints a general user manual. 'help COMMAND' prints a detailed | ||
| 9 | help page for the command COMMAND, if it exists. 'help' prints a list of all | ||
| 10 | available commands a short description for each. | ||
| 11 | |||
| 12 | EXAMPLES | ||
| 13 | help help | ||
| 14 | Prints this help page. | ||
| 15 | |||
diff --git a/docs/htr.txt b/docs/htr.txt new file mode 100644 index 0000000..7ed4d35 --- /dev/null +++ b/docs/htr.txt | |||
| @@ -0,0 +1,30 @@ | |||
| 1 | |||
| 2 | HELP PAGE FOR COMMAND htr | ||
| 3 | |||
| 4 | SYNTAX | ||
| 5 | htr [OPTIONS] [MOVES|$ID|@ID] | ||
| 6 | |||
| 7 | DESCRIPTION | ||
| 8 | Finds HTR for a given scramble. DR must be solved. A scramble can be given as | ||
| 9 | last argument of the command, or an ID of a saved scramble can be provided. If | ||
| 10 | none of the two is given, a prompt will ask the user to input a new scramble. | ||
| 11 | |||
| 12 | OPTIONS | ||
| 13 | from {ud|fb|rl} Allows to specify on which axis the DR is. This is usually | ||
| 14 | not needed, since nissy will automatically find it out. | ||
| 15 | b=N Specify a bound for the number of moves. N must be a number. | ||
| 16 | Default value: 20. | ||
| 17 | h Show hidden HTRs. | ||
| 18 | Default, if an HTR ending in e.g. R is shown, the equivalent | ||
| 19 | one ending in R' is hidden. | ||
| 20 | niss Use NISS. | ||
| 21 | Default: does not use NISS. | ||
| 22 | n=N Specify a maximum number of HTRs to be output. N must be a | ||
| 23 | number. | ||
| 24 | Default value: 1. | ||
| 25 | |||
| 26 | EXAMPLES | ||
| 27 | eo n=10 b=7 niss $1 | ||
| 28 | Finds up to 100 HTRs of lenth at most 7, possibly using NISS, including | ||
| 29 | "hidden" HTRs, for scramble $1. DR must be solved. | ||
| 30 | |||
diff --git a/docs/htrfinish.txt b/docs/htrfinish.txt new file mode 100644 index 0000000..7b58307 --- /dev/null +++ b/docs/htrfinish.txt | |||
| @@ -0,0 +1,23 @@ | |||
| 1 | |||
| 2 | HELP PAGE FOR COMMAND htrfinish | ||
| 3 | |||
| 4 | SYNTAX | ||
| 5 | htrfinish [OPTIONS] [MOVES|$ID|@ID] | ||
| 6 | |||
| 7 | DESCRIPTION | ||
| 8 | Similar to drfinish, but uses the moveset <U2,D2,R2,L2,F2,B2>. HTR must be | ||
| 9 | solved. The scramble can be given as the last argument of the command, or it | ||
| 10 | may be given as an $ID or @ID, or it can be typed out on the following line. | ||
| 11 | |||
| 12 | OPTIONS | ||
| 13 | b=N Specify a bound for the number of moves. N must be a number. | ||
| 14 | Default value: 20. | ||
| 15 | n=N Specify a maximum number ofsolutions to be output. N must be | ||
| 16 | a number. | ||
| 17 | Default value: 1. | ||
| 18 | |||
| 19 | EXAMPLES | ||
| 20 | htrfinish R L' U2 R' L F2 | ||
| 21 | Produces the following solution: | ||
| 22 | @1: U2 R2 F2 R2 U2 R2 F2 R2 (8) | ||
| 23 | |||
diff --git a/docs/invert.txt b/docs/invert.txt new file mode 100644 index 0000000..e4644e4 --- /dev/null +++ b/docs/invert.txt | |||
| @@ -0,0 +1,14 @@ | |||
| 1 | |||
| 2 | HELP PAGE FOR COMMAND invert | ||
| 3 | |||
| 4 | SYNTAX | ||
| 5 | invert [MOVES|$ID|@ID] | ||
| 6 | |||
| 7 | DESCRIPTION | ||
| 8 | Inverts a sequence of moves, which can be given also as $ID or @ID. The given | ||
| 9 | sequence must not use NISS (if it does, use the command unniss first). | ||
| 10 | |||
| 11 | EXAMPLES | ||
| 12 | invert F R D' | ||
| 13 | Prints D R' F' | ||
| 14 | |||
diff --git a/docs/nissy.txt b/docs/nissy.txt new file mode 100644 index 0000000..de4744b --- /dev/null +++ b/docs/nissy.txt | |||
| @@ -0,0 +1,88 @@ | |||
| 1 | |||
| 2 | ******************************************************************************* | ||
| 3 | ********************* NISSY: a cube solver and FMC helper ********************* | ||
| 4 | ******************************************************************************* | ||
| 5 | |||
| 6 | If you just want to solve the cube, type 'solve' followed by the scramble. This | ||
| 7 | will not always give you an optimal solution, unless it is 10 moves or less or | ||
| 8 | you use the "o" option. Finding the optimal solution might take very long if it | ||
| 9 | is 16 moves or more, especially for the first time. | ||
| 10 | |||
| 11 | Now the fun stuff. With nissy you can save and manipulate move sequences, for | ||
| 12 | example: | ||
| 13 | |||
| 14 | nissy-# save R' U' F | ||
| 15 | $1: R' U' F | ||
| 16 | nissy-# add L2D' $1 | ||
| 17 | $1: R' U' F L2 D' | ||
| 18 | |||
| 19 | You can then ask nissy to solve certain substepson a saved scramble: | ||
| 20 | |||
| 21 | nissy-# eo axis=rl $1 | ||
| 22 | @1: U D F' R (4) | ||
| 23 | |||
| 24 | And of course it uses also NISS, if you ask: | ||
| 25 | |||
| 26 | nissy-# eo niss axis=rl $1 | ||
| 27 | @1: (R) (1) | ||
| 28 | |||
| 29 | Notice that the sequences you save are marked with a $, while the "output" | ||
| 30 | sequences are marked with @. The difference between these two type of sequences | ||
| 31 | is that those marked with @ are temporary and get lost once you get new output. | ||
| 32 | Most commands accept as input either a move sequence typed out, a $-sequence or | ||
| 33 | a @-sequence. For example, you can however save a @-sequence and make it | ||
| 34 | persistent: | ||
| 35 | |||
| 36 | nissy-# save @1 | ||
| 37 | $2: (R) | ||
| 38 | |||
| 39 | Nissy also understands NISS. Let's see a more complicated example where you | ||
| 40 | save a scramble, ask for some EOs (using NISS) and then a DR on inverse: | ||
| 41 | |||
| 42 | nissy-# save R' U' F R U R2 F2 R2 D R2 U L2 U R2 D2 B' D U' R D R' D U2 F2 R' U' F | ||
| 43 | $3: R' U' F R U R2 F2 R2 D R2 U L2 U R2 D2 B' D U' R D R' D U2 F2 R' U' F | ||
| 44 | nissy-# eo n=10 niss axis=fb,rl $3 | ||
| 45 | Found 10 results. | ||
| 46 | @1: (U' L B D F) (5) | ||
| 47 | @2: (U' L B' D F) (5) | ||
| 48 | @3: (L B U D F) (5) | ||
| 49 | @4: (L B' U D F) (5) | ||
| 50 | @5: R U B U L (5) | ||
| 51 | @6: R U' L (B L) (5) | ||
| 52 | @7: R U' B U L (5) | ||
| 53 | @8: R L (L B L) (5) | ||
| 54 | @9: R (U2 D' F R) (5) | ||
| 55 | @10: R (U2 F D' R) (5) | ||
| 56 | nissy-# add @6 $3 | ||
| 57 | $3: R' U' F R U R2 F2 R2 D R2 U L2 U R2 D2 B' D U' R D R' D U2 F2 R' U' F R U' L (B L) | ||
| 58 | nissy-# unniss $3 | ||
| 59 | @1: L' B' R' U' F R U R2 F2 R2 D R2 U L2 U R2 D2 B' D U' R D R' D U2 F2 R' U' F R U' L | ||
| 60 | nissy-# invert @1 | ||
| 61 | @1: L' U R' F' U R F2 U2 D' R D' R' U D' B D2 R2 U' L2 U' R2 D' R2 F2 R2 U' R' F' U R B L | ||
| 62 | nissy-# save @1 | ||
| 63 | $5: L' U R' F' U R F2 U2 D' R D' R' U D' B D2 R2 U' L2 U' R2 D' R2 F2 R2 U' R' F' U R B L | ||
| 64 | nissy-# dr from rl $5 | ||
| 65 | @1: F2 U D2 F' B D B (7) | ||
| 66 | nissy-# | ||
| 67 | |||
| 68 | If you ask nissy to solve a substep (or the whole cube) using a sequence with | ||
| 69 | NISS as scramble, it will first un-NISS it (but without saving the unNISSed | ||
| 70 | scramble anywhere): | ||
| 71 | |||
| 72 | print $3 | ||
| 73 | $3: R' U' F R U R2 F2 R2 D R2 U L2 U R2 D2 B' D U' R D R' D U2 F2 R' U' F R U' L (B L) | ||
| 74 | nissy-# solve $3 | ||
| 75 | @1: F U' R2 F2 U2 F U2 R2 L2 D R2 U B2 D' L2 D B2 D2 (18) | ||
| 76 | |||
| 77 | Nissy knows how to solve certain common sub-steps for DR (or Thistlethwaite / | ||
| 78 | Kociemba algorithms). For now it does know more common speedsolving methods. | ||
| 79 | |||
| 80 | For a full list of commands type "help". For a more detailed help on a specific | ||
| 81 | command, type "help (command)". The help pages can also be found in the docs | ||
| 82 | folder. | ||
| 83 | |||
| 84 | If you want to report a bug (I'm sure there are many!) or give a suggestion, | ||
| 85 | you can send an email to sebastiano.tronto@gmail.com. | ||
| 86 | |||
| 87 | Have fun! | ||
| 88 | |||
diff --git a/docs/pic.txt b/docs/pic.txt new file mode 100644 index 0000000..0285a2f --- /dev/null +++ b/docs/pic.txt | |||
| @@ -0,0 +1,20 @@ | |||
| 1 | |||
| 2 | HELP PAGE FOR COMMAND pic | ||
| 3 | |||
| 4 | SYNTAX | ||
| 5 | pic [MOVES|$ID|@ID] | ||
| 6 | |||
| 7 | DESCRIPTION | ||
| 8 | Prints the cube state after applying the given scramble. | ||
| 9 | |||
| 10 | EXAMPLES | ||
| 11 | pic R' U' F R U R2 F2 R2 D R2 U L2 U R2 D2 B' D U' R D R' D U2 F2 R' U' F | ||
| 12 | Gives the following output: | ||
| 13 | UF UL UB UR DF DL DB DR FR FL BL BR | ||
| 14 | EP: FR UL FL UR UF DB DR BL UB BR DL DF | ||
| 15 | EO(F/B): x x x x x x x x | ||
| 16 | |||
| 17 | UFR UFL UBL UBR DFR DFL DBL DBR | ||
| 18 | CP: UBR UFR DFL DBL UFL UBL DBR DFR | ||
| 19 | CO(U/D): ccw cw ccw cw | ||
| 20 | |||
diff --git a/docs/pre.txt b/docs/pre.txt new file mode 100644 index 0000000..c2cfd96 --- /dev/null +++ b/docs/pre.txt | |||
| @@ -0,0 +1,18 @@ | |||
| 1 | |||
| 2 | HELP PAGE FOR COMMAND pre | ||
| 3 | |||
| 4 | SYNTAX | ||
| 5 | pre [MOVES|$ID1|@ID1] $ID2 | ||
| 6 | |||
| 7 | DESCRIPTION | ||
| 8 | Prepends either MOVES, the scramble memorized under $ID1 or the output sequence | ||
| 9 | memorized under @ID1 at the beginning of the scramble memorized under $ID2. If | ||
| 10 | none of MOVES, $ID1 or @ID1 is specified, the user will be asked to type the | ||
| 11 | moves. | ||
| 12 | Menmonic: "pre(pend) x to y" or just "pre(pend) to y". | ||
| 13 | |||
| 14 | EXAMPLES | ||
| 15 | add $1 | ||
| 16 | The user is required to type the moves that will be prepended to $1. | ||
| 17 | add F R B $1 | ||
| 18 | Prepends the moves F R B to scramble $1. Now scramble $1 begins with F R B. | ||
diff --git a/docs/print.txt b/docs/print.txt new file mode 100644 index 0000000..6c6c032 --- /dev/null +++ b/docs/print.txt | |||
| @@ -0,0 +1,19 @@ | |||
| 1 | |||
| 2 | HELP PAGE FOR COMMAND print | ||
| 3 | |||
| 4 | SYNTAX | ||
| 5 | print [$ID|@ID] | ||
| 6 | |||
| 7 | DESCRIPTION | ||
| 8 | Prints memorized sequences. If no argument is given, it prints all memorized | ||
| 9 | scrambles ($ only). If $ID or @ID is specified, it only prints the relative | ||
| 10 | memorized sequence. | ||
| 11 | |||
| 12 | EXAMPLES | ||
| 13 | |||
| 14 | Prints a list of all memorized scrambles (only $). | ||
| 15 | print $2 | ||
| 16 | Prints the second memorized scramble. | ||
| 17 | print @13 | ||
| 18 | Prints the 13th sequence that was part of the output of the last command. | ||
| 19 | |||
diff --git a/docs/quit.txt b/docs/quit.txt new file mode 100644 index 0000000..5866358 --- /dev/null +++ b/docs/quit.txt | |||
| @@ -0,0 +1,9 @@ | |||
| 1 | |||
| 2 | HELP PAGE FOR COMMAND quit | ||
| 3 | |||
| 4 | SYNTAX | ||
| 5 | quit | ||
| 6 | |||
| 7 | DESCRIPTION | ||
| 8 | Exits nissy. | ||
| 9 | |||
diff --git a/docs/replace.txt b/docs/replace.txt new file mode 100644 index 0000000..f147584 --- /dev/null +++ b/docs/replace.txt | |||
| @@ -0,0 +1,22 @@ | |||
| 1 | |||
| 2 | HELP PAGE FOR COMMAND replace | ||
| 3 | |||
| 4 | SYNTAX | ||
| 5 | eo [OPTIONS] [MOVES|$ID|@ID] | ||
| 6 | |||
| 7 | DESCRIPTION | ||
| 8 | Looks for non-optimal subsequences and replaces them to shorten the given | ||
| 9 | sequence. By default it tries to shorten every subsequence of up to 10 moves, | ||
| 10 | but this can be change with the "b" option. | ||
| 11 | It outputs at most 10 equivalent optimal sequences for each replaceable part. | ||
| 12 | |||
| 13 | OPTIONS | ||
| 14 | b=N Finds non-optimal subsequences of up to N moves. | ||
| 15 | |||
| 16 | EXAMPLES | ||
| 17 | replace D2 F' D2 U2 F' L2 R2 U' D B2 D B2 U B2 F L2 R' F' D U' | ||
| 18 | Produces the following output: | ||
| 19 | Replace [ R2 U' D B2 D B2 ] (moves 7-12) with: [ D R2 D U' ] (-6+4) | ||
| 20 | Replace [ R2 U' D B2 D B2 U ] (moves 7-13) with: [ D R2 D ] (-7+3) | ||
| 21 | Replace [ U' D B2 D B2 U ] (moves 8-13) with: [ R2 D R2 D ] (-6+4) | ||
| 22 | |||
diff --git a/docs/save.txt b/docs/save.txt new file mode 100644 index 0000000..a19dc18 --- /dev/null +++ b/docs/save.txt | |||
| @@ -0,0 +1,22 @@ | |||
| 1 | |||
| 2 | HELP PAGE FOR COMMAND save | ||
| 3 | |||
| 4 | SYNTAX | ||
| 5 | save [MOVES|@ID|$ID] | ||
| 6 | |||
| 7 | DESCRIPTION | ||
| 8 | Memorizes the scramble specified by MOVES, given as input or temporarily saved | ||
| 9 | as @ID, where ID is a number ('help nissy' for for more on IDs). If an $ID is | ||
| 10 | given, it makes a copy of the scramble. An identifier of the form $ID, where ID | ||
| 11 | is a number, is assigned to the memorized scramble. | ||
| 12 | |||
| 13 | EXAMPLES | ||
| 14 | save R U R' U' | ||
| 15 | Saves the scramble R U R' U'. | ||
| 16 | save F (B) | ||
| 17 | Saves the scramble F (B) (NISS notation). | ||
| 18 | save @3 | ||
| 19 | Saves the third output sequence of the last command. | ||
| 20 | save $2 | ||
| 21 | Makes a copy of the second saved scramble. | ||
| 22 | |||
diff --git a/docs/solve.txt b/docs/solve.txt new file mode 100644 index 0000000..1d83094 --- /dev/null +++ b/docs/solve.txt | |||
| @@ -0,0 +1,33 @@ | |||
| 1 | |||
| 2 | HELP PAGE FOR COMMAND solve | ||
| 3 | |||
| 4 | SYNTAX | ||
| 5 | solve [MOVES|$ID|@ID] | ||
| 6 | |||
| 7 | DESCRIPTION | ||
| 8 | Solves the given scramble, which can be given as a sequence of moves or as $ID | ||
| 9 | or @ID. If none is given, the user can type it on the next line. | ||
| 10 | The algorithm first tries to find a short (<=10 moves) solution, and then | ||
| 11 | switches to a 2-step algorithm (unless the option "o" is specified, in which | ||
| 12 | case it keeps looking for an optimal solution). | ||
| 13 | The first time it uses the 2-step algorithm it needs to load some tables, which | ||
| 14 | can take a few seconds. It runs much faster after that. If the option "o" is | ||
| 15 | specified, the first time it loads some large tables, which can take a minute | ||
| 16 | or two. | ||
| 17 | |||
| 18 | OPTIONS | ||
| 19 | b=N Only looks for solutions up to N moves. | ||
| 20 | n=N Tries to find multiple solutions, at most N. Multiple | ||
| 21 | Solutions will only be found if they are <=10 moves. | ||
| 22 | o Looks for optimal solution. | ||
| 23 | |||
| 24 | |||
| 25 | EXAMPLES | ||
| 26 | solve R' U' F | ||
| 27 | Solves the scramble R' U' F. | ||
| 28 | solve o b=14 $1 | ||
| 29 | Tries to solve the scramble $1 optimally, but stops if no solution of 14 | ||
| 30 | moves or shorter is found. | ||
| 31 | solve n=16 R L' U2 R' L F2 | ||
| 32 | Finds the 16 shortest solutions for the scramble above. | ||
| 33 | |||
diff --git a/docs/unniss.txt b/docs/unniss.txt new file mode 100644 index 0000000..399dd74 --- /dev/null +++ b/docs/unniss.txt | |||
| @@ -0,0 +1,14 @@ | |||
| 1 | |||
| 2 | HELP PAGE FOR COMMAND unniss | ||
| 3 | |||
| 4 | SYNTAX | ||
| 5 | unniss [MOVES|$ID|@ID] | ||
| 6 | |||
| 7 | DESCRIPTION | ||
| 8 | Removes NISS from a sequence of moves, which can be given also as $ID or @ID. | ||
| 9 | A sequence of the form A (B) is translated to B' A. | ||
| 10 | |||
| 11 | EXAMPLES | ||
| 12 | invert F R (D' L2) | ||
| 13 | Prints L2 D F R | ||
| 14 | |||
