Hanoi puzzle : Algorithms « Collections Data Structure « Java

Java 1.  2D Graphics GUI 2.  3D 3.  Advanced Graphics 4.  Ant 5.  Apache Common 6.  Chart 7.  Class 8.  Collections Data Structure 9.  Data Type 10.  Database SQL JDBC 11.  Design Pattern 12.  Development Class 13.  EJB3 14.  Email 15.  Event 16.  File Input Output 17.  Game 18.  Generics 19.  GWT 20.  Hibernate 21.  I18N 22.  J2EE 23.  J2ME 24.  JDK 6 25.  JNDI LDAP 26.  JPA 27.  JSP 28.  JSTL 29.  Language Basics 30.  Network Protocol 31.  PDF RTF 32.  Reflection 33.  Regular Expressions 34.  Scripting 35.  Security 36.  Servlets 37.  Spring 38.  Swing Components 39.  Swing JFC 40.  SWT JFace Eclipse 41.  Threads 42.  Tiny Application 43.  Velocity 44.  Web Services SOA 45.  XML Java Tutorial Java Source Code / Java Documentation Java Open Source Jar File Download Java Articles Java Products Java by API Photoshop Tutorials Maya Tutorials Flash Tutorials 3ds-Max Tutorials Illustrator Tutorials GIMP Tutorials C# / C Sharp C# / CSharp Tutorial C# / CSharp Open Source ASP.Net ASP.NET Tutorial JavaScript DHTML JavaScript Tutorial JavaScript Reference HTML / CSS HTML CSS Reference C / ANSI-C C Tutorial C++ C++ Tutorial Ruby PHP Python Python Tutorial Python Open Source SQL Server / T-SQL SQL Server / T-SQL Tutorial Oracle PL / SQL Oracle PL/SQL Tutorial PostgreSQL SQL / MySQL MySQL Tutorial VB.Net VB.Net Tutorial Flash / Flex / ActionScript VBA / Excel / Access / Word XML XML Tutorial Microsoft Office PowerPoint 2007 Tutorial Microsoft Office Excel 2007 Tutorial Microsoft Office Word 2007 Tutorial

Java » Collections Data Structure » Algorithms Screenshots  Hanoi puzzle public class HanoiTower {   static int nDisks = 3;   public static void main(String[] args) {     hanoiTower(nDisks, 'A', 'B', 'C');   }   public static void hanoiTower(int topN, char src, char inter, char dest) {     if (topN == 1)       System.out.println("Disk 1 from " + src + " to " + dest);     else {       // src to inter       hanoiTower(topN - 1, src, dest, inter);       // move bottom       System.out.println("Disk " + topN + " from " + src + " to " + dest);       //inter to dest       hanoiTower(topN - 1, inter, src, dest);     }   } }                     Related examples in the same category 1.  Anagrams 2.  Fibonacci 3.  Sieve 4.  Find connections using a depth-first search 5.  Find connections using hill climbing. 6.  Find optimal solution using least-cost 7.  Find the lost keys 8.  Compute the area of a triangle using Heron's Formula 9.  Compute prime numbers 10.  Print a table of fahrenheit and celsius temperatures 1 11.  Print a table of fahrenheit and celsius temperatures 2 12.  Print a table of Fahrenheit and Celsius temperatures 3 13.  Soundex - the Soundex Algorithm, as described by Knuth