Given only one face of the rubik's cube, is there any way to form the other faces randomly so we end up with valid solvable configuration?
Let’s suppose that I have an input which is only one face of the Rubik's cube stickers of only one face.
Let’s also say that input will be like follows:
"wrggyrgbo" the 9 stickers of the upper face _ consider the yellow as the upper_
The output should be a complete form of the solvable Rubik's cube stickers
Lastly, there is the notation considerations: