Computer Science – Discrete Mathematics
Scientific paper
2006-12-13
Computer Science
Discrete Mathematics
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.
Benditkis Sergey
Safro Illya
No associations
LandOfFree
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.
Profile ID: LFWR-SCP-O-476321