All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Algorithms
Two Towers Hanoi (Posted on 2020-05-27) Difficulty: 3 of 5
A Towers of Hanoi puzzle has all of its discs colored black or white according to parity. Looking at the starting/finished tower the discs alternate back and forth between black and white.

Take a colored set like this and separate the white discs from the black discs. The white discs are placed on one pole in order and the black discs are placed on a second pole in order.

Devise an algorithm that will transfer the discs back into the complete tower on the third pole. As a function of N, how few moves can a tower of N discs be reassembled on the third pole?

An example: the XS, S, M, L, XL discs in the linked puzzle would start with the XS, M, and XL discs colored black and be on the first pole while the S and L discs would be colored white and be on the second pole.

No Solution Yet Submitted by Brian Smith    
Rating: 3.0000 (1 votes)

Comments: ( You must be logged in to post comments.)
  Subject Author Date
re(2): Most of solutionJer2020-05-30 15:47:34
re: Most of solutionFrankM2020-05-29 10:19:36
Solution with explanationFrankM2020-05-29 10:13:53
Most of solutionJer2020-05-27 13:45:20
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (2)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (5)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2021 by Animus Pactum Consulting. All rights reserved. Privacy Information