Rubik's cube computing algorithm

383 Views Asked by At

Is it possible to solve a 3x3 Rubik's cube using a tree similar to a 'mini-max game tree' (listing all possible unique moves, then listing further moves from this and so on), or is the sample space too large, given that most combinations require only 17/18 moves to be solved (and the maximum is proved to be 20)?