tag:blogger.com,1999:blog-5479191305093780981.post8223814939556183483..comments2022-02-28T11:35:44.077-08:00Comments on Lex Spoon: Rubik's Cube's difficulty crackedLex Spoonhttp://www.blogger.com/profile/13859632965228608649noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-5479191305093780981.post-25068916254532766712010-09-09T19:33:55.401-07:002010-09-09T19:33:55.401-07:00I've also recently stumbled across a Google Te...I've also recently stumbled across a Google Tech Talk from 2008 you may have not seen (I didn't see it until tonight): http://www.youtube.com/watch?v=WQw7c-PliB4&feature=related<br /><br />They used 7 terabytes of disk space to prove that Rubik's Cube can be solved in a minimum of 26 steps. Obviously this newer minimum supersedes this result.John Zabroskihttps://www.blogger.com/profile/17294832205855394228noreply@blogger.comtag:blogger.com,1999:blog-5479191305093780981.post-34540083200840179452010-08-24T08:14:36.969-07:002010-08-24T08:14:36.969-07:00You might want to take a look at Richard Korf'...You might want to take a look at Richard Korf's Ph.D. thesis (1984?) under Alan Newell. He got his Doctorate by building a Rubik's Cube solver. The difficulty in this task is that the solver requires *non-serializable* subgoals. I am not sure how a clever proof would do this, but they would probably have to prove the minimal subgoals.John Zabroskihttps://www.blogger.com/profile/17294832205855394228noreply@blogger.com