Cubenovice
Forever Slow
True but those insertions would not be 3 cycles.In theory, any skeleton can be converted to an optimal solution for the scramble if you're willing to try long enough insertions.
The insertion would actually be "a shorter solution + moves around it that cancel out your existing solution"
And by the way, I've contrived some tricky cases where I thought the existing Insertion Finder might miss the solution I expected due to needing a suboptimal 3-cycle (for instance), but it would still find it. So if you want to have it find solutions that the existing one misses, you probably have to consider a lot of suboptimal insertion algs.
Again I dare to ask: what do we consider optimal here?
An optimal edge cycle is only 6 moves but if there are no 6 moves insertions possible for your skeleteon then a 7 mover, then an 8 mover etc etc should be considered as the optimal solution for the specific cycle to be solved.
In FMC insertion finding I consider the shortest possible insertion "optimal".
For edges this is more often than not based on a 3 cycle longer than 6 moves
edit:
"suboptimal insertion alg" sounds like solving an 8 move case with more moves which does not make sense.
It would be something like using an A9 commutator to solve an 8 move case...
But in reality this would just cancel an additional move for the same net result.
You only need to include optimal algs for all posible cycles, where optimal for specific corners cases can be up to 12 moves ( Per special)
Last edited: