Celebrating Puzzles
Doofus writes "The New York Times is running an article, Celebrating puzzles, that is about a puzzle exhibit opening at the Lilly Library at Indiana University. The primary collector, a Mr. Slocum, has been collecting interesting and challenging 3D puzzles for many years, and has helped to curate the exhibition. The article describes one variation of the towers of Hanoi puzzle that involves 65 rings and has a mind-blowing 18,446,744,073,709,551,616 moves in a perfect solution. A twist on the standard museum exhibition — the puzzles on exhibit are stored each night in drawers — that must be puzzled open by the first visitors the following morning."
The N-ring puzzle requires 2^N - 1 moves to solve. The article is incorrect.
A mathematical analysis can be found here with some cool pictures, but it doesn't explain the rules, unfortunately.
Rhymes that keep their secrets will unfold behind the clouds.There upon the rainbow is the answer to a neverending story
I hadn't a clue what a Slocum puzzle was when I first heard about this. However, Wikipedia to the rescue: http://en.wikipedia.org/wiki/Jerry_Slocum
e .htm. It's a frustratingly sweet way to waste yet another workday. :)
Also, there is a page where you can play many different Slocum puzzles while you're supposed to be working: http://www.puzzleworld.org/SlidingBlockPuzzles/ab
The Chinese Rings puzzle is not a variant of the Towers of Hanoi. It's this.
_ puzzle.html
http://www.puzzles.ca/puzzle_data_3/chinese_rings
They are both recursive puzzles, but that's where the similarity ends.
MathException: Division by zero error.
Justice is the sheep getting arrested while an impartial judge declares the vote void.