brododragon
Member
Ok, thanks.There is a new update 1.0.5. It addressees some of the suggestions. Also there is a new website address kubesolver.com
- Fix a problem when some sequences were not printed. (sequences that had equivalent partial sequences to some other sequences)
- Fix a problem with moves that don't change cube state
- Add new option max-depth-after-first-match (da)
- Add option to set all options as commands rather than commmand line argument. Now it's possible to set max nunber of moves or depth in config.
Example:
set n 10 - print first 10 sequences found
set da 1 - only searcg sequences at most 1 move longer than the shortest sequence found
set d 14 - only search sequences at most 14 moves long.
@brododragon. Sorry I missed your previous post somehow. Yes, the program can brick your computer if you try to calculate a full cube from the beginning. The program isn't meant for that honestly. You can use a the solve_two_phase command for that. But it should rather be used for cases which can be solved either in a small number of moves or with small number of generators.
You can;t solve that case with RU because it affects edges in D layer. My program isn't designed to gracefully fail on impossible inputs.
What do you think about my idea?
A command to define a case but without a few pieces, to which the program would gen algs for all possible cases. I might write a seudo-interface later.
Here's some suedo code (at da 1):
init_empty_cube
add_f2l
add_edges_orientation
add_corners_orientation
solve [CO]
1:
...
2:
...
3:
...
4:
...
5:
...
6:
...
7:
...
(gens all CO cases)