fefong / java_towerOfHanoi_equation Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Example Application: Tower of Hanoi minimal number of moves required to solve.

0 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
bin/java_towerOfHanoi_equation		bin/java_towerOfHanoi_equation
resources		resources
src/java_towerOfHanoi_equation		src/java_towerOfHanoi_equation
.gitignore		.gitignore
README.md		README.md

Repository files navigation

Java Equation Tower of Hanoi

Example Application: Tower of Hanoi

Equation | Formula

Math.pow(2, n)-1;

Some links for more in depth learning

About

Example Application: Tower of Hanoi minimal number of moves required to solve.

java netbeans eclipse hanoi tower towerofhanoi felipefong ffong

Report repository

Releases

No releases published

Packages

No packages published

Languages

Java 100.0%