【^_^】最少步数的研究进展 —— 22步 ( -_-; )

migl

暴雨梨花汗！
大家自己看。

Tomas Rokick个人主页：
Tom Rokicki's Personal Web Site

非官方发布!

++++++++++++++++++++++++++++++++


原来吧里有人发过这个帖。

[ 本帖最后由 migl 于 2009-4-23 10:53 编辑 ]

migl

那个 个人主页的 第一段：We just proved that all positions of Rubik's cube can be solved in 22 or fewer face turns. (The link is to the proof of 25; the proof of 22 is essentially the same with just a lot of sets solved.) A nice article reporting this result is in the August 6th issue of New Scientist. This proof was made possible by the generous contribution of CPU time from Sony Pictures Imageworks with the help of John Welborn, on the same machines used for movies such as Spider-Man 3 and Surf's Up. I'm currently working on 21.


google的翻译（直译）：
我们只是证明，所有职位的魔方可以得到解决的22个或更少的脸上满。 （这个链接是要证明25 ; 22日的证明基本上是相同的，只需很多套解决。 ）好用的文章报告这一结果是在8月6日发行新科学家。这证明了可能的慷慨捐助的CPU时间由索尼图形图像的帮助下，约翰Welborn ，同机用于电影，如蜘蛛侠3和冲浪的最多。我目前正在研究21 。


=================================================


翻译得比较混乱。不过大家自己组织一下，基本能看懂。


=============


27楼的翻译：

原帖由 fuwu1927 于 2009-7-2 17:57 发表

We just proved that all positions of Rubik's cube can be solved in 22 or fewer face turns. (The link is to the proof of 25; the proof of 22 is essentially the same with just a lot of sets solved.) A nice article reporting this result is in the August 6th issue of New Scientist. This proof was made possible by the generous contribution of CPU time from Sony Pictures Imageworks with the help of John Welborn, on the same machines used for movies such as Spider-Man 3 and Surf's Up. I'm currently working on 21.

我们已经证明了所有打乱状态的魔方都可以在22步或者更少的步数内还原。（这个链接是证明最少25步的；但是最少22步的证明原理是基本相同的，只是需要大量的还原设置。）在8月6日发行的《新科学家》上有一篇很好的文章已经对这一结果作出了陈述。这次证明得以成功，很大程度上得益于索尼图形图像运作公司以及约翰·韦伯提供的CPU time的慷慨援助，该机器还曾用于许多电影诸如《蜘蛛侠3》和《冲浪企鹅》的制作。目前我正在研究最少21步的证明。

[ 本帖最后由 migl 于 2010-4-15 12:05 编辑 ]

migl

感谢 fuwu1927 的准确翻译。
感谢 noski 的热心帮助。