by Bob Brown

Rubik’s cube solved in 26 moves or fewer

Opinion

Aug 21, 20071 min

This from University of Maryland at Baltimore County:

Northeastern Computer Science PhD student Daniel Kunkle has proven that any configuration of a Rubik’s cube can be solved in 26 moves or fewer moves. The previous upper bound was 27.

Show me more

Rubik’s cube solved in 26 moves or fewer

More from this author

Small Cell Forum seeks advice from large enterprises

How to make Fully Homomorphic Encryption “practical and usable”

iPhone 8 Rumor Rollup: Cranking up the processors; 3D cameras; $1K-plus price

SNL one step ahead of Amazon with Echo Silver

You really should know what the Andrew File System is

Getting a jump on private LTE networks

iPhone 8 Rumor Rollup: Tim Cook cites rumors; LTE shortfall; envisioning a function area

Boring old enterprise vendors pay interns well

Show me more

AI data boom gives tape storage a new lease on life

Nvidia lets you build your own AI clusters locally with PAIR software

Why Nvidia doesn't fit Forrester's data center matrix

Has the hype around ‘Internet of Things’ paid off? | Ep. 145

Episode 1: Understanding Cisco’s Converged SDN Transport

Episode 2: Pluggable Optics and the Internet for the Future

Master Linux Math with the bc Command | Easy CLI Calculations Explained!

Master Linux Math in Seconds: How to Use the expr Command Like a Pro

How to Do Math in the Command Line Using Double Parentheses