Christopher Mowla
Premium Member
I'm not sure if you have seen my document for solving a dedge in one algorithm (assuming both wings are not solved), but for the 4x4x4, no more than 12 btm is needed for any given case. Here's my post. As you can see on the second page of the document, the average move count for these cases is a little less than 11 btm. 1/3 of the 211 cases can be solved in 10 btm or less, less than 1/4 may require 12 btm, leaving a little less than half of the cases to require 11 btm.If you ask me, Redux and Yau are about equal for 4x4x4, and K4 is a bit worse but still capable of pretty good times. K4's big weakness is the F3L movecount, even though the lookahead is great in that part.
Also to everyone who hasn't seen my posts in that thread, I have another document which contains some very move efficient 2 2-cycles.