Submit your own Neatorama post and vote for others' posts to earn NeatoPoints that you can redeem for T-shirts, hoodies and more over at the NeatoShop!


Calculating How Randomness Creeps In

I loved the 15-puzzle — the game with 15 tiles and a single empty space in a 4x4 grid — when I was a kid.

The goal is to slide the tiles around and put them in numerical order or, in some versions, arrange them to form an image.

The first 15 puzzle I was able to complete was a picture of a cat with a mouse sitting on its head. It seemed difficult at first, but after trying the game countless times throughout the days and weeks, I was able to get the hang of it.

The game has become a staple of party-favor bags since it was introduced in the 1870s. It has also caught the attention of mathematicians, who’ve spent more than a century studying solutions to puzzles of different sizes and startling configurations.
Now, a new proof solves the 15 puzzle, but in reverse. The mathematicians Yang Chu and Robert Hough of Stony Brook University have identified the number of moves required to turn an ordered board into a random one.

Check out this story over at Nautilus.

(Image Credit: Wikimedia Commons)

Login to comment.
Email This Post to a Friend
"Calculating How Randomness Creeps In"

Separate multiple emails with a comma. Limit 5.


Success! Your email has been sent!

close window

This website uses cookies.

This website uses cookies to improve user experience. By using this website you consent to all cookies in accordance with our Privacy Policy.

I agree
Learn More