Devil's Algorithm for LSE

[GodCubing]

I was wondering if a Devil's algorithm could be applied to the last step of the Roux method, LSE. It could be potentially shortened by M slice equivalences (adding solve states like M, M2, and M' away from being solved). I just think this would be really cool, but I know nothing about Devil's algorithms or Hamiltonian circuits.

 

[BirdCubing]

I could tell you a little bit of Hamiltonian circuits and more on the devils algorithm

 

[artless1der]

how could that work? i mean, when you get to LSE there can potentially be either 0, 2, 4, or 6 edges mis-oriented
... not sure how one algorithm can acckunt for that, and esp not be as fast as intuition (or current LSE algs)...

 

[GodCubing]

I could tell you a little bit of Hamiltonian circuits and more on the devils algorithm

please do

how could that work? i mean, when you get to LSE there can potentially be either 0, 2, 4, or 6 edges mis-oriented
... not sure how one algorithm can acckunt for that, and esp not be as fast as intuition (or current LSE algs)...

devil's algorithm can account for all the different scenarios for LSE, and it would certainly not be faster, but it would be fun.

I didn't mention this in the original post but the original orientation of the centers is maleable. If it is not too many cases with M2 centers and solved centers, that would be nice, but if it is too many then it could be done with solved centers.