<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet href="/style/rss/rss_feed.xsl" type="text/xsl" media="screen"?><?xml-stylesheet href="/style/rss/rss_feed.css" type="text/css" media="screen" ?><rss version="2.0"><channel><title>Clipmarks | kidora's Games collection</title><link>http://clipmarks.com/clipper/kidora/collection/Games/sort/latest-comments/</link><feedUrl>http://rss.clipmarks.com/clipper/kidora/collection/Games/sort/latest-comments/</feedUrl><ttl>15</ttl><description>Clip, tag and save information that's important to you. Bookmarks save entire pages...Clipmarks save the specific content that matters to you!</description><language>en-us</language><item><title>Rubik's Cube Proof Cut To 25 Moves</title><link>http://clipmarks.com/clipmark/616AB520-3D69-46D7-998E-38E12752B37B/</link><description>&lt;b&gt;clipped by:&lt;/b&gt; &lt;a href="http://clipmarks.com/clipper/kidora/"&gt;kidora&lt;/a&gt;&lt;br&gt;&lt;b&gt;clipper's remarks:&lt;/b&gt;  Finally ... maybe now I can solve the dam thing! &lt;br&gt;&lt;div border="2" style="margin-top: 10px; border:#000000 1px solid;" width="90%"&gt;&lt;div style="background-color:"&gt;&lt;div align="center" width="100%" style="padding:4px;margin-bottom:4px;background-color:#666666;overflow:hidden;"&gt;&lt;span style="color:#FFFFFF;font-weight:bold;"&gt;Clip Source: &lt;a style="color:#FFFFFF;" href="http://science.slashdot.org/article.pl?sid=08/03/26/2237221" title="http://science.slashdot.org/article.pl?sid=08/03/26/2237221"&gt;science.slashdot.org&lt;/a&gt;&lt;/span&gt;&lt;/div&gt;&lt;div style="padding: 10px;"&gt;&lt;div style="text-align:left;"&gt;&lt;I&gt;"A scrambled Rubik's cube can be solved in just 25 moves, regardless of the starting configuration. Tomas Rokicki, a Stanford-trained mathematician, has proven the new limit (down from 26 which was proved last year) &lt;A href="http://arxivblog.com/?p=332"&gt; using a neat piece of computer science&lt;/A&gt;. Rather than study individual moves, he's used the symmetry of the cube to study its transformations in sets. This allows him to separate the 'cube space' into 2 billion sets each containing 20 billion elements. He then shows that a large number of these sets are essentially equivalent to other sets and so can be ignored. Even then, to crunch through the remaining sets, he needed a workstation with 8GB of memory and around 1500 hours of time on a Q6600 CPU running at 1.6GHz. Next up, 24 moves."&lt;/I&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;/div&gt;&lt;br&gt;&lt;div style="margin-bottom: 40px;"&gt;&lt;/div&gt;</description><clipSource>http://science.slashdot.org/article.pl?sid=08/03/26/2237221</clipSource><pubDate>Fri, 28 Mar 2008 04:17:08 GMT</pubDate></item></channel></rss>