Herbert Kociemba
Veteran
- Joined
- Nov 29, 2008
- Messages
- 302
Wow, how did you get that?
I derived this several years ago and I can't remember the details any more. The recursion for the number of positions in k moves can be written as (A^k)*x with some matrix A and some vector x and the largest eigenvalue of A then is the asymptotic branching factor. In OBTM and QTM instead of HTM, the asymtptotic branching factor is 1/(1.5^(1/(2(n-1)))-1).