diff options
| author | Sebastiano Tronto <sebastiano.tronto@gmail.com> | 2021-11-11 21:37:34 +0100 |
|---|---|---|
| committer | Sebastiano Tronto <sebastiano.tronto@gmail.com> | 2021-11-11 21:37:34 +0100 |
| commit | 3568412f8f230774d0d11d7ed1c897424f95d3ef (patch) | |
| tree | 77223792d8c925a9b1fc32b3f4341e943b5f8209 /docs/drfinish.txt | |
| parent | 67e1b5e6e6a2c917a2fe58a37a1382c982b1e5c5 (diff) | |
| download | nissy-3568412f8f230774d0d11d7ed1c897424f95d3ef.tar.gz nissy-3568412f8f230774d0d11d7ed1c897424f95d3ef.zip | |
Rewritten from scratch. Welocme nissy 2.0!
Diffstat (limited to 'docs/drfinish.txt')
| -rw-r--r-- | docs/drfinish.txt | 29 |
1 files changed, 0 insertions, 29 deletions
diff --git a/docs/drfinish.txt b/docs/drfinish.txt deleted file mode 100644 index efd12ac..0000000 --- a/docs/drfinish.txt +++ /dev/null | |||
| @@ -1,29 +0,0 @@ | |||
| 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 | |||
