aboutsummaryrefslogtreecommitdiff
path: root/docs/solve.txt
diff options
context:
space:
mode:
Diffstat (limited to 'docs/solve.txt')
-rw-r--r--docs/solve.txt33
1 files changed, 0 insertions, 33 deletions
diff --git a/docs/solve.txt b/docs/solve.txt
deleted file mode 100644
index 1d83094..0000000
--- a/docs/solve.txt
+++ /dev/null
@@ -1,33 +0,0 @@
1
2HELP PAGE FOR COMMAND solve
3
4SYNTAX
5solve [MOVES|$ID|@ID]
6
7DESCRIPTION
8Solves the given scramble, which can be given as a sequence of moves or as $ID
9or @ID. If none is given, the user can type it on the next line.
10The algorithm first tries to find a short (<=10 moves) solution, and then
11switches to a 2-step algorithm (unless the option "o" is specified, in which
12case it keeps looking for an optimal solution).
13The first time it uses the 2-step algorithm it needs to load some tables, which
14can take a few seconds. It runs much faster after that. If the option "o" is
15specified, the first time it loads some large tables, which can take a minute
16or two.
17
18OPTIONS
19b=N Only looks for solutions up to N moves.
20n=N Tries to find multiple solutions, at most N. Multiple
21 Solutions will only be found if they are <=10 moves.
22o Looks for optimal solution.
23
24
25EXAMPLES
26solve R' U' F
27 Solves the scramble R' U' F.
28solve 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.
31solve n=16 R L' U2 R' L F2
32 Finds the 16 shortest solutions for the scramble above.
33

Generated with cgit - Back to sebastiano.tronto.net