Rubik’s Cube proves AI isn’t always best at computational tasks

A humble Rubik’s Cube has proven that AI isn’t always best at performing computational tasks.

Researchers from the University of California developed an AI system capable of solving a Rubik’s Cube in 1.2 seconds.

That sounds impressive – and to us mere humans it most certainly is, with the world record at 3.47 seconds being held by Yusheng Du – but the AI solved the Rubik’s Cube around three times slower than the fastest algorithm not trained using a neural network.

MIT’s min2phase algorithm beat the AI using a traditional computational method. Developed last year, the algorithm is programmed specifically for speedcubin’.

DeepCubeA, the AI developed by the researchers at the University of California, was trained using reinforcement learning. It consistently practised how to minimise the ‘cost’ to reach a solution.

There are 43,252,003,274,489,856,000 possible combinations to a Rubik’s Cube, so DeepCubeA had quite a task ahead of it.

DeepCubeA trained over two days across 1,000 puzzles and managed to solve all of them. 60 percent of the time, DeepCubeA managed it with the fewest number of moves possible.

Rubik’s Cube aficionados will know that it can always be solved within 20 moves, the so-called God’s Number, or fewer. DeepCubeA isn’t far off with an average of 21 moves, but it takes around 24 seconds for such challenges.

Unlike algorithms specifically designed to solve cubes, DeepCubeA could be applied to other problems. The researchers hope such an AI could one day be used for helping to create drugs by predicting the structure of proteins.

The full study was published in Nature Machine Intelligence.

Interested in hearing industry leaders discuss subjects like this and their use cases? Attend the co-located AI & Big Data Expo events with upcoming shows in Silicon Valley, London, and Amsterdam to learn more. Co-located with the IoT Tech Expo, Blockchain Expo, and Cyber Security & Cloud Expo.

Leave a Reply

Your email address will not be published. Required fields are marked *