Results 1 to 5 of 5

Thread: Lower bound for Megaminx in htm and qtm

  1. #1

    Default Lower bound for Megaminx in htm and qtm

    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:

    http://cubezzz.dyndns.org/drupal/?q=node/view/328

  2. #2
    Member qqwref's Avatar
    Join Date
    Dec 2007
    Location
    a <script> tag near you
    WCA Profile
    2006GOTT01
    YouTube
    qqwref2
    Posts
    7,092

    Default

    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.
    Computer cube PB averages of 12: [Clock: 5.72] [Pyraminx: 3.33] [Megaminx: 49.52]
    [2x2: 2.66] [3x3: 8.45] [4x4: 29.06] [5x5: 52.69] [6x6: 1:34.78] [7x7: 2:20.34]

  3. #3

    Default

    Quote Originally Posted by qqwref View Post
    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.
    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 by Herbert Kociemba; 03-01-2012 at 01:07 PM.

  4. #4
    Super-Duper Moderator Lucas Garron's Avatar
    Join Date
    Jul 2007
    Location
    Where the rolling foothills rise
    WCA Profile
    2006GARR01
    YouTube
    LucasGarron
    Posts
    3,254

    Default

    Quote Originally Posted by Herbert Kociemba View Post
    What is the shortest nontrivial identity on Megaminx?
    At most 10 moves. FRU'R'U2F'L'ULU2' works on Megaminx.
    garron.us | cubing.net | twisty.js | ACube.js | Mark 2 | Regs | Show people your algs: alg.cubing.net | Cube on your smartphone! cubing.net/touch

  5. #5
    Member
    Join Date
    Jun 2008
    WCA Profile
    2008COUR01
    Posts
    1,711

    Default

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

Bookmarks

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •