Lower bound for Megaminx in htm and qtm

Discussion in 'Puzzle Theory' started by Herbert Kociemba, Mar 1, 2012.

Welcome to the Speedsolving.com. You are currently viewing our boards as a guest which gives you limited access to join discussions and access our other features. By joining our free community of over 30,000 people, you will have access to post topics, communicate privately with other members (PM), respond to polls, upload content and access many other special features. Registration is fast, simple and absolutely free so please, join our community today!

If you have any problems with the registration process or your account login, please contact us and we'll help you get started. We look forward to seeing you on the forums!

Already a member? Login to stop seeing this message.
  1. Herbert Kociemba

    Herbert Kociemba Member

    Nov 29, 2008
    I analyzed the number of generic move sequences to get lower bounds for God's number of Megaminx, taking into account the commutativity of moves. There are a lot of commutating moves because of the many disjoint faces of Megaminx. In htm, I found a lower bound of 45 moves and in qtm a lower bound of 55 moves.

    I posted the details here:

  2. qqwref

    qqwref Member

    Dec 18, 2007
    a <script> tag near you
    I made a somewhat similar recursion a while back and ended up with, I think, 43 moves for the Megaminx. I'm not sure exactly where our techniques differ, but I do like this technique in general, as you can get some pretty nice results without a huge amount of work.
  3. Herbert Kociemba

    Herbert Kociemba Member

    Nov 29, 2008
    I assume, the techniques differ somehow, because the difference between 43 und 45 means that you have more than 1000 times the number of move sequences with 45 moves.
    I would be really pleased, if
    1. Someone could double check, that there are 25 unordered pairs of faces (X,Y), which have no pieces in common and either X or Y (or both) have pieces in common with some arbitrary different fixed face,e.g. U.
    2. The same for 15 unordered triples (X,Y,Z), which have no pieces in common and either X or Y or Z have pieces in common with another different face, for example the U face.
    3. Compute the true number of positions of Megaminx out to some depth in htm and qtm to check if the numbers are the same for the first ??? depths. This depends on the length of the shortest nontrivial identity. Btw, What is the shortest nontrivial identity on Megaminx?
    Last edited: Mar 1, 2012
  4. Lucas Garron

    Lucas Garron Super-Duper Moderator Staff Member

    At most 10 moves. FRU'R'U2F'L'ULU2' works on Megaminx.
  5. TMOY

    TMOY Member

    Jun 29, 2008
    The niklas done the wrong way (L' U R U' L U R' U') is a 8-move identity.

Share This Page