Solutions to the generalized Towers of Hanoi problem

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 pages

Scientific paper

The purpose of this paper is to prove the Frame-Stewart algorithm for the generalized Towers of Hanoi problem as well as finding the number of moves required to solve the problem and studying the multitude of optimal solutions. The main idea is to study how to most effectively move away all but the last disc and use the fact that the total number of moves required to solve the problem is twice this number plus one.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Solutions to the generalized Towers of Hanoi problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solutions to the generalized Towers of Hanoi problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solutions to the generalized Towers of Hanoi problem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-35406

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.