aboutsummaryrefslogtreecommitdiff
path: root/docs/replace.txt
diff options
context:
space:
mode:
authorSebastiano Tronto <sebastiano.tronto@gmail.com>2020-06-21 23:01:57 +0200
committerSebastiano Tronto <sebastiano.tronto@gmail.com>2020-06-21 23:01:57 +0200
commit0e8d73bb3edcc8bdff6e3ded442b66f68265059a (patch)
tree4f92deb9ace97e79332c0e7ce390b76b81aeaae9 /docs/replace.txt
parent4e359b44ce111b04cc4d2b28033fba4ab4e6e989 (diff)
downloadnissy-0e8d73bb3edcc8bdff6e3ded442b66f68265059a.tar.gz
nissy-0e8d73bb3edcc8bdff6e3ded442b66f68265059a.zip
First push
Diffstat (limited to '')
-rw-r--r--docs/replace.txt22
1 files changed, 22 insertions, 0 deletions
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
2HELP PAGE FOR COMMAND replace
3
4SYNTAX
5eo [OPTIONS] [MOVES|$ID|@ID]
6
7DESCRIPTION
8Looks for non-optimal subsequences and replaces them to shorten the given
9sequence. By default it tries to shorten every subsequence of up to 10 moves,
10but this can be change with the "b" option.
11It outputs at most 10 equivalent optimal sequences for each replaceable part.
12
13OPTIONS
14b=N Finds non-optimal subsequences of up to N moves.
15
16EXAMPLES
17replace 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:
19Replace [ R2 U' D B2 D B2 ] (moves 7-12) with: [ D R2 D U' ] (-6+4)
20Replace [ R2 U' D B2 D B2 U ] (moves 7-13) with: [ D R2 D ] (-7+3)
21Replace [ U' D B2 D B2 U ] (moves 8-13) with: [ R2 D R2 D ] (-6+4)
22

Generated with cgit - Back to sebastiano.tronto.net