First of all imagine one of those toys for babies - three rings going down in size that fit over a tapered peg. Reight, you've got three pegs with three rings on one of them, biggest at the bottom, smallest on top. You have to move the rings one at a time to another peg ending up again with the biggest at the bottom and the smallest at the top. You can never have a bigger one on top of a smaller one. It's possible in a few moves (about 12 I think.) Now then, when you do it with four rings it takes a few more moves, five obviously more and so on. There's a mathematical formula for how many moves it takes each time. So here's the question. Assuming that it takes one second to move one ring how long would it take if there were 64 rings? A pint for the nearest.
Go on, have a guess. If you get somewhere between 10% and 900% of the answer I'll pay you one on by credit card.
It takes 7 moves to finish the three ring and three peg problem.</p> How many pegs are you using for the 64 ring version?</p>
RE: My head hurts The puzzle is called the towers of hanoi. It should be familar to anyone who has studied computing/software. You can write a solution in about 3 lines of prolog or lisp. However I have tried my best to blank this from my memory, so I have no idea how to do it. Errr, 4 days?
As a rough guess I'm going to say that the answer lies somewhere between the top of this thread and the bottom of it. You do the maths. virtual pint will be fine thanks