![]() It is a mathematical puzzle having applications in computer algorithms and programs as well as being used in psychology and medicine field as well. It is also called as the Tower of Brahma or Lucas Tower. It says if you can solve n-1 cases, then you can solve the nth case. Tower of Hanoi is one of the main applications of recursion.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |