-
-
Notifications
You must be signed in to change notification settings - Fork 46.6k
Adding Tower of Hanoi #9936
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Labels
awaiting triage
Awaiting triage from a maintainer
Comments
Aloneking789
added a commit
to Aloneking789/Python
that referenced
this issue
Oct 6, 2023
Fixes TheAlgorithms#9936 This code prompts the user to input the number of disks and the names of the source, auxiliary, and target pegs. It also checks that the peg names are distinct. Then, it calls the tower_of_hanoi function to solve the Tower of Hanoi problem based on the user's input.
Aloneking789
added a commit
to Aloneking789/Python
that referenced
this issue
Oct 6, 2023
Fixes TheAlgorithms#9936 This code prompts the user to input the number of disks and the names of the source, auxiliary, and target pegs. It also checks that the peg names are distinct. Then, it calls the tower_of_hanoi function to solve the Tower of Hanoi problem based on the user's input.
Aloneking789
added a commit
to Aloneking789/Python
that referenced
this issue
Oct 6, 2023
Fixes TheAlgorithms#9936 This code prompts the user to input the number of disks and the names of the source, auxiliary, and target pegs. It also checks that the peg names are distinct. Then, it calls the tower_of_hanoi function to solve the Tower of Hanoi problem based on the user's input.
Aloneking789
added a commit
to Aloneking789/Python
that referenced
this issue
Oct 6, 2023
Fixes TheAlgorithms#9936 This code prompts the user to input the number of disks and the names of the source, auxiliary, and target pegs. It also checks that the peg names are distinct. Then, it calls the tower_of_hanoi function to solve the Tower of Hanoi problem based on the user's input.
|
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
What would you like to share?
The Tower of Hanoi is a classic problem in computer science and mathematics that involves moving a tower of disks from one peg to another, subject to certain constraints.
Additional information
No response
The text was updated successfully, but these errors were encountered: