aboutsummaryrefslogtreecommitdiff
path: root/docs/replace.txt
diff options
context:
space:
mode:
authorSebastiano Tronto <sebastiano.tronto@gmail.com>2021-11-11 21:37:34 +0100
committerSebastiano Tronto <sebastiano.tronto@gmail.com>2021-11-11 21:37:34 +0100
commit3568412f8f230774d0d11d7ed1c897424f95d3ef (patch)
tree77223792d8c925a9b1fc32b3f4341e943b5f8209 /docs/replace.txt
parent67e1b5e6e6a2c917a2fe58a37a1382c982b1e5c5 (diff)
downloadnissy-3568412f8f230774d0d11d7ed1c897424f95d3ef.tar.gz
nissy-3568412f8f230774d0d11d7ed1c897424f95d3ef.zip
Rewritten from scratch. Welocme nissy 2.0!
Diffstat (limited to '')
-rw-r--r--docs/replace.txt22
1 files changed, 0 insertions, 22 deletions
diff --git a/docs/replace.txt b/docs/replace.txt
deleted file mode 100644
index f147584..0000000
--- a/docs/replace.txt
+++ /dev/null
@@ -1,22 +0,0 @@
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