5 ms·
As far as I can tell, this is simply a (or more appropriately, The) re-discovery of the upper bound on Kociemba's algorithm. The authors apparently did not sear
by mfukar 16y ago
As far as I can tell, this is simply a (or more appropriately, The) re-discovery of the upper bound on Kociemba's algorithm. The authors apparently did not search for optimal solutions (which is not strictly necessary anyway since we have a lower bound), which you can assume it's equivalent to stopping Kociemba's algorithm when a solution of less than 21 steps is found, for all intents and purposes.
- svat 16y agoDiscovery, not re-discovery. The upper bound of 20 (that no position takes more than 20 moves) was not known earlier.
- mfukar 16y agoTrue. I was referring to the cumulative effort since Reid proved that the upper bound of Kociemba's algorithm is 29 moves. I apologize for any misunderstandings, but I cannot edit that post now.