Generalizations of the Hanoi Towers Problem

Computer Science – Discrete Mathematics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

Our theme bases on the classical Hanoi Towers Problem. In this paper we will define a new problem, permitting some positions, that were not legal in the classical problem. Our goal is to find an optimal (shortest possible) sequence of discs' moves. Besides that, we will research all versions of 3-pegs classical problem with some special constraints, when some types of moves are disallowed.

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

Generalizations of the Hanoi Towers 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 Generalizations of the Hanoi Towers Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalizations of the Hanoi Towers Problem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-476321

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