Re: Tower of Hanoi problem- 4 Peg iterative solution
- From: "valencialong@xxxxxxxxx" <valencialong@xxxxxxxxx>
- Date: 1 Apr 2006 20:02:56 -0800
Hello,
I believe there are different ways of writing out the function. It is
logical to say that if I have n number of disks to be moved, I would
select k number of disks to move first using 4 pegs for optimal
solution. Note: 0<k<n. However, the variable k is unknown. The formula
runs if let's say I move k disks within this number of moves : F(n-k) +
F(k) + F(n-k) = 2F(n-k) + 2^k. To generalise it, the formula can be
viewed as the following:
If the final function is to be a function of T,
number of disks to be n, the general formula for 4 pegs is T(n, 4) = 2
* T(n- k, 4) + T(k,3)
What we would need to determine is obviously k which is a constant.
.
- References:
- Tower of Hanoi problem- 4 Peg iterative solution
- From: valencialong@xxxxxxxxx
- Re: Tower of Hanoi problem- 4 Peg iterative solution
- From: Gugleat
- Tower of Hanoi problem- 4 Peg iterative solution
- Prev by Date: Re: a question about reducible polynomials
- Next by Date: Re: Bilinear Forms
- Previous by thread: Re: Tower of Hanoi problem- 4 Peg iterative solution
- Next by thread: Re: Notation for Unit Disks and Balls
- Index(es):
Relevant Pages
|