Am I a bad programmer if I can't understand Towers of Hanoi?

No; I can easily imagine many of my former colleagues deciding to give that one a miss, before getting back down to their software jobs!! But you will be able to understand it with a little effort. First understand the puzzle itself. read more

No; I can easily imagine many of my former colleagues deciding to give that one a miss, before getting back down to their software jobs!! But you will be able to understand it with a little effort. read more

Concept of Tower of Hanoi. You are not allowed to moved two discs at a time. You can’t move disc 5 if you don’t move disc 4. llly, you can’t move disc 4 if you don’t move disc 3. read more

The Towers of Hanoi problem is very well understood. You have 3 pegs (A, B, C) and a number of discs (usually 8) we want to move all the discs from the source peg (peg A) to a destination peg (peg B), while always making sure that a bigger disc never ends up on top of a smaller one. read more