I just deleted that post ^ because I updated the document. I went here and looked at the first 82 "seed algorithms" listed (12 moves max) and found briefer algorithms for 14 of the 58 cases.
Originally Posted by cmowla
I credited this source as "AF" (Algorithm Finder) followed by :S_ _. . The number following the S is the seed algorithm number (the seed algorithms first listed on that page I just provided a link for).
Note that several algorithms that existed prior to generation date of these "seed algorithms" can be made from these seed algorithms, but I did not credit that source for algorithms which I definitely knew existed before. If someone has created one of the algorithms I credited to AF's seeds (prior to December 14, 2011), let me know.
I found multiple solution's from AF for the cases I added algorithms from it to, but many of the solutions were similar (even though 82 seed algorithms are listed, I can definitely say that more than half were closely related), and I chose the best solutions with speed in mind. However, some cases from AF didn't have fast solutions.
All cases now have pure solutions.
In addition, all cases can be handled in 15 btm or less! Here is the btm move distribution (of the shortest algorithms for all size cubes) in the collection provided in my document.
Average: 12.52 btm/case.