• Subscribe

iSGTW Statistic of the Week - 26

Statistic of the Week - 26


Rubik's Cube was invented in the 1970s by Erno Rubik of Hungary and has more than 43 quintillion different states.
Stock image from sxc.hu

26: the number of moves required to solve any configuration of a Rubik's cube. This is a new world record, announced last week, and beating the previous record by one move.

Northeastern University Computer Science professor Gene Cooperman and graduate student Dan Kunkle used Teragrid and university resources to sort through 7 terabytes of data, covering 43 quintillion possible combinations.

The result? A program that can solve any Rubik's cube in around a second, and in 26 moves or less.

And why?

"The Rubik's cube is a testing ground for problems of search and enumeration," Cooperman explains. "Search and enumeration is a large research area encompassing many researchers working in different disciplines-from artificial intelligence to operations."

"The Rubik's cube allows researchers from different disciplines to compare their methods on a single, well-known problem."

Join the conversation

Do you have story ideas or something to contribute? Let us know!

Copyright © 2023 Science Node ™  |  Privacy Notice  |  Sitemap

Disclaimer: While Science Node ™ does its best to provide complete and up-to-date information, it does not warrant that the information is error-free and disclaims all liability with respect to results from the use of the information.

Republish

We encourage you to republish this article online and in print, it’s free under our creative commons attribution license, but please follow some simple guidelines:
  1. You have to credit our authors.
  2. You have to credit ScienceNode.org — where possible include our logo with a link back to the original article.
  3. You can simply run the first few lines of the article and then add: “Read the full article on ScienceNode.org” containing a link back to the original article.
  4. The easiest way to get the article on your site is to embed the code below.