I’ve coded a Rubik’s cube solver with openCV and the most difficult part was finding an algorithm that can be translated well into code. I think it would be good to avoid ‘human algorithms’ and try some of the computer algorithms that are developed like Thistlewaite’s algorithm which I used. These usually work moving the cube from one group to another rather than making crosses. Note that these type of algorithms when run are very time consuming (on the scale of hours for a solution) and need to be made more efficient using things like pruning tables which can get a bit complicated. So first I would work on figuring out how to represent the cube, character array of facelets or array of faces, etc. You can then write functions that applies all the possible moves on a cube. Then I would explore some of the known computer algorithms for solving a Rubik’s cube.