#### brododragon

##### Member

So, recently, I've been trying to invent a new method, and have been playing around with algorithms, trying to find something that works. After thinking about it fit a bit, I think I found a way to generate algorithms to go from one unsolved state to another.

For simplicities' sake, I'm going to act like this is software. Also, let State 1 be the starting state and State 2 be the ending state.

Here's the idea: You specify what pieces are where, in a specific orientation for the State 1 (leaving some pieces unspecified). Then, this would be repeated with State 2. Then, the software would generate every possible state of the cube that could be in and still be state 2.

Then the software would find optimal algorithms to go from all possible State 1's to all State 2's, keeping track of the algorithms, their lengths, and where the piece/pieces that need to be moved are. Finally, the shortest algorithm would be selected. If you did not like it, you could look through the algorithms to find one you like.

Then the software would find optimal algorithms to go from all possible State 1's to all State 2's, keeping track of the algorithms, their lengths, and where the piece/pieces that need to be moved are. Finally, the shortest algorithm would be selected. If you did not like it, you could look through the algorithms to find one you like.

I don’t know how software works, but could you just give “grey pieces” the same value/ID as other “grey pieces” that are the same type (corner/edge/middle).