News for hackers. Stuff that matters.
Re:The perplexing life of Ernő Rubik (1986) by danielvf on Wednesday January 31, 2018 @11:33AM (#16275104)
> Mathematicians vied to find the shortest method of unscrambling, which became known as God's algorithm. There's speculation that an all-knowing being could restore any Cube in 22 moves, but the shortest method discovered so far requires 52. It was found by a British mathematician named Morwen B. Thistlewaite.

In 2010 it was finally proven that 20 moves is enough to solve any possible Rubik's cube ordering, and that it can be no lower.

Re:The perplexing life of Ernő Rubik (1986) by passivepinetree on Wednesday January 31, 2018 @12:31PM (#16275581)
That's super interesting. Do you have a source?
Re:The perplexing life of Ernő Rubik (1986) by schmich on Wednesday January 31, 2018 @12:38PM (#16275657)
God's number is 20: http://www.cube20.org/

They pruned a bunch and then did brute force evaluation of the remaining "hard" positions. It seems strange that there hasn't been a more elegant approach to proving this. An interesting (if obvious) corollary to this result is that the maximum moves between any two Rubik's configurations is 20.

The relevant HN thread at that time: https://news.ycombinator.com/item?id=1587340

Re:The perplexing life of Ernő Rubik (1986) by rurban on Thursday February 01, 2018 @07:36AM (#16281401)
In combinatorics counting is always the best strategy. People are usually not good in counting, computers are better fit. So no surprise.
Re:The perplexing life of Ernő Rubik (1986) by passivepinetree on Wednesday January 31, 2018 @05:38PM (#16278191)
You're the best. Thank you!
Re:The perplexing life of Ernő Rubik (1986) by TrunkleBob on Wednesday January 31, 2018 @12:39PM (#16275668)
The page from the team that completed the proof: http://www.cube20.org/
Re:The perplexing life of Ernő Rubik (1986) by DSMan195276 on Wednesday January 31, 2018 @12:44PM (#16275743)