Very Difficult Puzzles Puzzles by Price Puzzles by Type Puzzles by Difficulty Puzzles by Maker Puzzles by Designer IPP Puzzles Sports Theme Puzzles Puzzle Boxes Wine & Beer Theme Puzzles Australiana Themed Puzzles Executive Desk Puzzles Coffee Table Puzzles Kids Puzzles Jigsaw Puzzles Puzzle Books Puzzling Objects Discounted Puzzle Sets Collectible Puzzles Selling Out Gift Vouchers Gift Wrapping |
Mr Puzzle - We've got puzzles!
It’s not known who first looked at the old Chinese Ring puzzle and thought that the movement of the rings in the solution would have two states equating to on/of or 0 and 1 used in computer binary code. But they did. And so a new group of puzzle classifications was made. Since then there’s been not only binary puzzles, but ternary puzzles where pieces have three states and more. Right up to the current record holder Generation Lock - a 15-ary puzzle. Many of these puzzles require a lot of moves to complete due to the recursive nature of the solution. Lucky not many have the number of the Generation Lock - 341,718,750. Yes, that’s 340 million+ ! The puzzle is to remove the ribbon from the elephant maze disentanglement puzzle. This is a very nice adaptation of the classic staircase disentanglement puzzle, known in French as Baguenaudier (very appropriately it literally means time-waster) they are closely related to the better known "Chinese Ring Puzzle" or "Devil's Needle puzzle". Its a type of "n-ary" puzzle meaning each move has "n" number of state - in this case 2 states being binary. Read more about n-ary puzzles and see others we have here. The puzzle consists of a looped handle interlocked with nine rings. The object is to remove the nine rings from the handle. It will take 341 move to do the puzzle but there's a method and once you know it you'll certainly be able to solve the puzzle. The Chinese Ring puzzle is a type types of "n-ary" puzzle meaning each move has "n" number of state - in this case 2 states being binary. These types of "n-ary" puzzles have either 2 states - binary, or 3 states - ternary, and more. Read more about n-ary puzzles and see others we have here. The objective of the puzzle is to move the entire stack of disks and the ball on top to another rod, obeying the following simple rules: Mathematically this is a type of "n-ary" puzzle meaning each move has "n" number of state - in this case 2 states being binary. Read more about n-ary puzzles and see others we have here. Designed by Jean Claude Constantin this puzzle is called Lock 250 because there are 250 moves to open... that means another 250 moves to close again. And that's only if you get them all correct! The 4 steel sliders on the front move the internal wooden plates of the puzzles and which slider you can move depends on the position of the internal plates. Designed by Jean Claude Constantin this puzzle is the big (VERY BIG) brother of the Lock 250 also available for sale at Mr Puzzle. The 8 steel sliders on the front move the internal wooden plates of the puzzles and which slider you can move depends on the position of the internal plates. Dr Goetz Schwandtner from Germany did an analysis of the number of moves to solve the puzzle and came up with over 340 million moves! 341 718 750 to be exact. He has published his theory here. He says that "assuming we employ a group of puzzlers willing to work full time on this lock, without holidays and in shifts, so that the solving is going on 24 hours a day, and 365 days a year, and on average 2 seconds per move, this will take about 21.6 years". A big thanks to Goetz for the analysis. LIMITED EDITION of 30 puzzles released 27th November 2009 Status: 30th November 2009. SOLD OUT. There are 22 pieces to this extremely difficult caged burr puzzle designed by Goh Pit Khiam. You'll get a feel for just how difficult it is if you watch Brian put it together on YouTube http://www.youtube.com/watch?v=FKavWv3Jin8. It took him until he was putting the last one together to get the courage to video it. By this time he had learnt to do it without the BurrTools computer animated solution and do it in about 5 mins. The first one took me a lot longer... a lot... at least 30 minutes with the computer!
*** SPECIAL PROMOTION *** |
|||||||||||||||||||||||||||||||||||||||||||||||||||