If you just care about finding any solution, you can consider a multi-step approach such as Thistlethwaithe's algorithm. If insead you want to find the shortes

If you just care about finding any solution, you can consider a multi-step approach such as Thistlethwaithe's algorithm. If insead you want to find the shortest possible solution for any giveb configuration, that indeed is much harder! The best optimal solvers at the moment use very large pruning tables to help the brute-force search. A nice exercise could be solving a 2x2x2 cube. That one is much more manageable. This page is great is you want to learn more: https://www.jaapsch.net/puzzles/compcube.htm https://www.jaapsch.net/puzzles/compcube.htm