Shop OBEX P1 Docs P2 Docs Learn Events
Are you smarter than a Chimpanzee ? how's your logic. — Parallax Forums

Are you smarter than a Chimpanzee ? how's your logic.

whiteoxewhiteoxe Posts: 794
edited 2014-07-28 16:40 in General Discussion
just a bit of fun....in the movie 'Rise of the Planet of the Apes the genetically modified chimp completed the Hanoi puzzle in the minimum 15 moves using 4 disks.
I will be honest I did it in 43 my first attempt before getting the idea. Second go was easy in 15 moves. What's your score on your first attempt ? I'm going to regret posting my first attempt.

http://www.daftlogic.com/projects-towers-of-hanoi.htm



if that's too simple try 5 disks..... but it does not count your moves !

http://zylla.wipos.p.lodz.pl/games/hanoi5e.html

Comments

  • Heater.Heater. Posts: 21,230
    edited 2014-07-26 04:21
    OK, I'll have a go a this question as it seems to be too hard for the folks around here.

    No.
  • whiteoxewhiteoxe Posts: 794
    edited 2014-07-26 05:02
    So refreshingly admirable of you Heater. ..you don't have a pretentious bone in your body. Just a straight answer to a fair question. !
  • Hal AlbachHal Albach Posts: 747
    edited 2014-07-26 05:40
    I remember reading about the Towers over 50 years ago while serving in the Navy. It was about when the World would end. IIRC there was a Monastery wherein there were three diamond rods embedded firmly in the rock and upon the first rod were 64 golden discs of gradually increasing size. A Monk was tasked to move the disks, one at a time, never placing a larger disc over a smaller one, until all discs have been moved to the third rod. At that point the World would end. A mathematician had come up with a huge number of years (can't remember exact number, possibly in the billions) if the Monk moved one disk per second, 24/7/365, no lunch breaks, no weekends off, no vacation. I guess it was one of those jobs where it was exciting for about the first five seconds, then sheer boredom.

    A poster on the website indicated over 580 billion years!
  • Heater.Heater. Posts: 21,230
    edited 2014-07-26 05:56
    Sometimes I think that monk already finished his task. Round about 1969. The world seems to have been crashing to the end ever since.
  • Martin_HMartin_H Posts: 4,051
    edited 2014-07-26 07:42
    Time is precious, so I built a robot to solve that problem for me:

    Mankind is now free from the oppressive labor of Tower of Hanoi or Rubik's Cube solving.
  • Heater.Heater. Posts: 21,230
    edited 2014-07-26 07:51
    Martin,

    That is just gorgeous.
  • Martin_HMartin_H Posts: 4,051
    edited 2014-07-26 09:04
    @Heater, hey thanks!
  • whiteoxewhiteoxe Posts: 794
    edited 2014-07-26 16:38
    just because you need to know.... I like that wooden Hanoi puzzel you made. I'll have to find a way to make one for my dear mum. She has taken up Bridge (cards) does really well the scores are posted online, jigzaw puzzels and suduko and crosswords (she is making sure she dosent get alzheimer's , thats her theory) I just have to find a way with no tools ;) Ill start her off on 3 disks up to 6 i think.
  • W9GFOW9GFO Posts: 4,010
    edited 2014-07-26 16:51
    I think I broke it...

    hanoi14.jpg
    558 x 406 - 47K
  • Heater.Heater. Posts: 21,230
    edited 2014-07-26 16:58
    W9GF0
    I think I broke it..
    Damn chimps :)

    Seems you don't need Chimps to solve this, ants will do:

    In 2010, researchers published the results of an experiment that found that the ant species Linepithema humile were successfully able to solve the Tower of Hanoi problem through non-linear dynamics and pheromone signals.

    From wikipedia some place.
  • whiteoxewhiteoxe Posts: 794
    edited 2014-07-26 17:13
    W9GFO wrote: »
    I think I broke it...

    hanoi14.jpg

    you would be caged and electric prodded for that if you were a chimp.
  • whiteoxewhiteoxe Posts: 794
    edited 2014-07-26 17:18
    Heater. wrote: »
    W9GF0

    Damn chips :)

    Seems you don't need Chimps to solve this, ants will do:

    In 2010, researchers published the results of an experiment that found that the ant species Linepithema humile were successfully able to solve the Tower of Hanoi problem through non-linear dynamics and pheromone signals.

    From wikipedia some place.
    I would have loved to sit in on the lecture they gave them on non-linear dynamics ;) x^2 + x - 1 = 0\,.
  • whiteoxewhiteoxe Posts: 794
    edited 2014-07-27 13:41
    Hal Albach wrote: »
    I remember reading about the Towers over 50 years ago while serving in the Navy. It was about when the World would end. IIRC there was a Monastery wherein there were three diamond rods embedded firmly in the rock and upon the first rod were 64 golden discs of gradually increasing size. A Monk was tasked to move the disks, one at a time, never placing a larger disc over a smaller one, until all discs have been moved to the third rod. At that point the World would end. A mathematician had come up with a huge number of years (can't remember exact number, possibly in the billions) if the Monk moved one disk per second, 24/7/365, no lunch breaks, no weekends off, no vacation. I guess it was one of those jobs where it was exciting for about the first five seconds, then sheer boredom.

    A poster on the website indicated over 580 billion years!

    that's a little hard to believe, but why don't you do a little experiment and build the puzzle with just 32 disks, then post back to us here soon as you finish the puzzle ? :innocent:
  • Heater.Heater. Posts: 21,230
    edited 2014-07-27 13:48
    whiteoxe,

    No, no that's the wrong way around. If you don't believe it then the onus is on you to do the experiment in order to convince yourself one way or the other.

    Catch you later.
  • ElectricAyeElectricAye Posts: 4,561
    edited 2014-07-27 14:28
    Heater. wrote: »
    ...

    Seems you don't need Chimps to solve this, ants will do.....

    Ants? Better yet, how about some Physarum polycephalum (slime mold)?

    http://jeb.biologists.org/content/216/9/1546.full.pdf
  • Hal AlbachHal Albach Posts: 747
    edited 2014-07-27 15:19
    whiteoxe wrote: »
    that's a little hard to believe, but why don't you do a little experiment and build the puzzle with just 32 disks, then post back to us here soon as you finish the puzzle ? :innocent:

    If accepting your challenge would grant me the time to do it, it might be a tempting offer except that living for millions or billions of years just to move some disks around and nothing else, well.....

    Here's a link to a Wiki page that sums it up rather nicely, and quickly, to boot!
    http://en.wikipedia.org/wiki/Tower_of_Hanoi

    The section under Origins
  • whiteoxewhiteoxe Posts: 794
    edited 2014-07-27 16:30
    ;) I was giving you the challenge Hal, thought I'd be dead by a few thousand years when you finished ! not sure how that halving the number of disks would take though. A bit like that old chess tale where the Persian king was so delighted with his servants invention of Chess(my parents had a Persian friend , well he insisted he was Persian, only in OZ to develop land, and he swore Chess was a Persian game)

    The servant just asked for a grain of rice on the first square of the new board and double it for the next square and so on until the 64 squares were finished. It ended up being more grain than in all the world. Hang on I'll google, OK it was 2 ^63 grains. which is unbelievably larger than if the board only had half the number of squares. You just might get the Hanoi puzzle done with only 32 disks :)
  • Hal AlbachHal Albach Posts: 747
    edited 2014-07-27 17:03
    On average, there are approximately 31,557,600 seconds in a year. (2^31) / secs per year comes out to just over 68 years. We both would still be around, drinking a toast to a monumental waste of time and life. (33 disks would take 136 years. Each disk doubles the amount of time.)

    My bad! Misread the formula, # of moves = 2^n - 1.
    32 discs will take 136 years, sorry, I'll be too dead to do any toasting. (33 discs will take a little over 272 years.)
  • whiteoxewhiteoxe Posts: 794
    edited 2014-07-27 17:09
    Fantastic Hal, I'm going to build one for my mum who likes puzzle's for christmas. Don't think Ill put 32 disks on it that would be mean :)
  • ercoerco Posts: 20,256
    edited 2014-07-27 17:10
    Since Martin_H posted, here's my first robot arm (~2010) moving 4 disks. Made from a BS2E, three hobby servos and a $5 toy. Boy howdy, I need a video speedup feature!
  • whiteoxewhiteoxe Posts: 794
    edited 2014-07-27 17:18
    I love it!
  • Martin_HMartin_H Posts: 4,051
    edited 2014-07-27 18:45
    Erco, while both of our robot arms are noble in their own way, I think these guys have us beat:
  • ercoerco Posts: 20,256
    edited 2014-07-27 19:08
    Pity that arm. It will wear itself out many times over attempting to finish that task.

    Arthritis, fibromyalgia, carpal tunnel, boredom, mark my words, that poor little arm will call in sick one day.
  • LoopyBytelooseLoopyByteloose Posts: 12,537
    edited 2014-07-28 16:40
    How's my logic? Bananas...

    The most interesting application of the Hanoi Tower Puzzle is its application to backing up your hard disk. It seems to work pretty well at doing a cycle of backups that require less space than other backup schemes.

    I believe it may also work with Rsynch to alternate between partial and full backups to save time. But the primary purpose is to have a longer backup history with less storage involved.

    http://en.wikipedia.org/wiki/Backup_rotation_scheme
Sign In or Register to comment.