Results 1 to 2 of 2

Math Help - Tower of Hanoi Question

  1. #1
    Newbie
    Joined
    Nov 2009
    Posts
    23

    Tower of Hanoi Question

    Suppose the Tower of Hanoi rules are changed so that the stones may only be transferred to an adjacent clearing in one move. Let In be the minimum number of moves required to transfer tower from clearing A to clearing C?

    Find a recursive relation for In.
    Guess a formula for In.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Flow Master
    mr fantastic's Avatar
    Joined
    Dec 2007
    From
    Zeitgeist
    Posts
    16,948
    Thanks
    5
    Quote Originally Posted by kturf View Post
    Suppose the Tower of Hanoi rules are changed so that the stones may only be transferred to an adjacent clearing in one move. Let In be the minimum number of moves required to transfer tower from clearing A to clearing C?

    Find a recursive relation for In.
    Guess a formula for In.
    Have you tried doing any research on these questions using Google?
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. [SOLVED] Tower of Hanoi Problem and skipping a move
    Posted in the Discrete Math Forum
    Replies: 4
    Last Post: September 19th 2011, 08:32 AM
  2. square tower question
    Posted in the Trigonometry Forum
    Replies: 1
    Last Post: April 27th 2010, 02:54 AM
  3. Towers of Hanoi
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: June 2nd 2009, 03:54 PM
  4. tower question
    Posted in the Trigonometry Forum
    Replies: 1
    Last Post: November 12th 2008, 11:29 AM
  5. Tower Question
    Posted in the Geometry Forum
    Replies: 4
    Last Post: June 21st 2008, 08:53 AM

Search Tags


/mathhelpforum @mathhelpforum