The Chess Variant Forum

My 5x5x5 Brute Force solver for the Professor's Cube is named Omnia Obtorquebantur. That's Latin for "All will be turned," in reference to every possible move being generated.



It has every possible "edge solving algorithm" through depth 13 solved, which takes up 52 Gigabytes on my hard drive. It has other crazy-impossible high-end features, like use of up to 120 Gigabytes of hash tables to prune the search tree by up to 6-ply, which for brute force cube solvers, is very much unheard of. The branching factor for the 5x5x5 cube is roughly 45 * 42^(d-1) where d is the depth searched. There are 45 moves available at each depth, and all but 3 of them after move 1 will be unique to the next level (the other 3 either undo the progress or could have been done with one less move into total). So it has many more nodes than the game of chess.