Page 3 of 10 FirstFirst 12345 ... LastLast
Results 21 to 30 of 99

Thread: God's number proven at 20

  1. #21
    Member irontwig's Avatar
    Join Date
    Apr 2009
    Location
    Sweden
    WCA Profile
    2010JERN01
    YouTube
    jernqvist
    Posts
    1,444

    Default

    Quote Originally Posted by RCTACameron View Post
    Quote Originally Posted by hawkmp4 View Post
    On to 4x4!

    Edit: This isn't serious. Not at this point in time, at least.
    What about 2x2?
    http://www.jaapsch.net/puzzles/cube2.htm

  2. #22

    Default

    Quote Originally Posted by RCTACameron View Post
    Quote Originally Posted by hawkmp4 View Post
    On to 4x4!

    Edit: This isn't serious. Not at this point in time, at least.
    What about 2x2?
    I thought that was already done, and it was 11.

    EDIT: Ninja'd.
    If anyone wants to add me on Guild Wars 2 send me a PM :tu

  3. #23
    Member Rinfiyks's Avatar
    Join Date
    Mar 2010
    Location
    York, United Kingdom
    YouTube
    Rinfiyks
    Posts
    177

    Default

    Quote Originally Posted by RCTACameron View Post
    Quote Originally Posted by hawkmp4 View Post
    On to 4x4!

    Edit: This isn't serious. Not at this point in time, at least.
    What about 2x2?

    Quote Originally Posted by hic0057 View Post
    I'm wondering if it's a coincidence how there is exactly 20 pieces (12 edges and 8 corners.) This is excluding the core but that doesn't change position.
    I wonder if God's Number for 2x2 would be 8 moves.

    Anyway, this is amazing.
    Because the 2x2x2 has so little permutations, it can easily be brute forced. Here's a table. God's number is 11 for a 2x2x2.
    3x3x3 PBs - Single: 15.90, AO5: 22.52, AO12: 25.38, Usual Average: 26 - 28

  4. #24

    Default

    Quote Originally Posted by cmowla View Post
    Quote Originally Posted by mrCage View Post
    Exactly how many positions are of maximum distance from solved? And are all these symmetrical positions??

    Per
    "Distance-20 positions are both rare and plentiful; they are rarer than one in a billion positions, yet there are probably more than one hundred million such positions. We do not yet know exactly how many there are."
    If there was an exhaustive search that number should be known. Or could have easily been known if implemented Oh well, my main concern was the second question...

  5. #25
    Member qqwref's Avatar
    Join Date
    Dec 2007
    Location
    a <script> tag near you
    WCA Profile
    2006GOTT01
    YouTube
    qqwref2
    Posts
    6,337

    Default

    But there wasn't really an exhaustive search. They didn't bother to optimize solutions because they just needed to show every position could be done in 20 or fewer moves. (As they said they could analyze 2 million positions optimally per second, but prove 1 billion positions to have a solution of 20 or fewer moves, it would probably have taken some decades at Google's server farm to compute optimal solutions for everything. That is, 17500 computer-years.)
    Computer cube PB averages of 12: [Clock: 5.72] [Pyraminx: 3.44] [Megaminx: 49.52]
    [2x2: 2.66] [3x3: 8.71] [4x4: 29.06] [5x5: 52.69] [6x6: 1:34.78] [7x7: 2:20.34]

  6. #26
    Member Zarxrax's Avatar
    Join Date
    Jan 2009
    Location
    North Carolina
    Posts
    1,227

    Default

    Now that they know which solutions need 20 moves, they could take a look specifically at those, and try to reduce the numbers... right?
    Single: 15.43; Avg5: 21.20; Avg12: 23.10

  7. #27
    Member
    Join Date
    Feb 2010
    Location
    Winnipeg, MB
    YouTube
    Kabuthunk
    Posts
    47

    Default

    This is awesome. Although on the cube20 site, we can't use the numbers at the bottom to find the 'average' number of moves needed to solve, since they stated on the page that they didn't "optimally" solve each position, just found a solution of 20 or less.

    But yeah... I'm surprised there's still well over a hundred million (at least 300 mil on the site, but not 'optimally' solved) that need a full 20 rotations.

    Although I'm curious how they came to their conclusion that "FU-F2D-BUR-F-LD-R-U-LUB-D2R-FU2D2" was the hardest solve for the computers.

  8. #28
    Premium Member Bryan's Avatar
    Join Date
    Oct 2007
    Location
    Rochester, MN
    WCA Profile
    2007LOGA01
    Posts
    1,296

    Default

    Quote Originally Posted by Zarxrax View Post
    Now that they know which solutions need 20 moves, they could take a look specifically at those, and try to reduce the numbers... right?
    All you need is one solution that can't be reduced, and they say they have those.
    CubingUSA.com - Find other cubers, be notified of upcoming competitions, and more.

  9. #29
    Member
    Join Date
    May 2008
    Location
    Louisville, CO, USA
    WCA Profile
    2008PALO01
    Posts
    1,381

    Default

    Quote Originally Posted by Zarxrax View Post
    Now that they know which solutions need 20 moves, they could take a look specifically at those, and try to reduce the numbers... right?
    No need to, really- there are some positions that can't be solved in any less than 20 moves. 20 is the lowest upper bound we'll ever have.
    Megaminx- 1:56.33 | 3x3- 24.74 | 2x2 - 7.06 (all a12)
    Looking for the best 3x3? | Want to get faster?

  10. #30
    Member
    Join Date
    Oct 2006
    Location
    Malden, MA, USA
    WCA Profile
    2006NORS01
    YouTube
    cuBerBruce
    Posts
    657

    Default

    Quote Originally Posted by mrCage View Post
    Quote Originally Posted by cmowla View Post
    Quote Originally Posted by mrCage View Post
    Exactly how many positions are of maximum distance from solved? And are all these symmetrical positions??

    Per
    "Distance-20 positions are both rare and plentiful; they are rarer than one in a billion positions, yet there are probably more than one hundred million such positions. We do not yet know exactly how many there are."
    If there was an exhaustive search that number should be known. Or could have easily been known if implemented Oh well, my main concern was the second question...
    The number of symmetric positions that require 20 moves to solve is exactly 1,091,994 (source: http://kociemba.org/math/c1.htm). All the rest of the known 20f* positions are unsymmetric. (Some undoubtedly have symmetry in edges only or corners only.)

    A list of some of the known 20f* positions can be found here. This list only includes 1 position for each set of positions that are equivalent with respect to symmetry & antisymmetry.

    I understand the group is thinking about the creation of a BOINC project to get the exact number of positions at each distance from solved. That may not happen for awhile, though.

    My raw video of the announcement at US Nationals is embedded here.
    Last edited by cuBerBruce; 08-09-2010 at 10:18 AM. Reason: removed unnecessary quote

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
  •