Explain towers of hanoi problem with illustrative diagrams
Answers
Answered by
1
Answer:
here Ur Answer Buddy
Tower of Hanoi consists of three pegs or towers with n disks placed one over the other. The objective of the puzzle is to move the stack to another peg following these simple rules. Only one disk can be moved at a time. No disk can be placed on top of the smaller disk.
Similar questions
Math,
6 months ago
Chemistry,
6 months ago
Social Sciences,
6 months ago
Math,
1 year ago
Math,
1 year ago