Any body know how to make a Tower of Hanoi game in c#

Question

0.00/5 (No votes)

See more:

I would like to make a Tower of Hanoi game that means there should be N number of disk and K pegs.The Main problem is trying to change the pegs from 1st to the last one.The radius of the disk will be from 1 to N and the complete disks should be moved from the first peg to the last one(the disks should be piled in the increasing order of Radius size at every stage.
Any one having any Idea??

Posted 16-Jan-12 1:23am

Arun Varghese

Add a Solution

3 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Prerak Patel · Answer 1 · 2012-01-16T01:30:00

Solution 1

Google[^] knows.

Towers of Hanoi Puzzle Simulation[^]
http://azerdark.wordpress.com/2008/07/30/c-tower-of-hanoi/[^]

Posted 16-Jan-12 1:30am

Prerak Patel

v2

Atalia Beukes · Answer 2 · 2012-06-01T05:35:00

Solution 3

Have a look at my article:
Towers of Hanoi[^]

Posted 1-Jun-12 5:35am

Atalia Beukes

Jαved · Answer 3 · 2012-01-16T01:33:00

Hi,

C#

// The Towers Of Hanoi
// C#
// Tested under Visual Studio .NET
//

using System;

namespace Hanoi
{
  class Solution
  {
    public static void doHanoi(int n, string f, string t, string u)
    {
      if (n <= 1) 
      {
        System.Console.WriteLine(f + " --> " + t);
      } 
      else 
      {
        doHanoi(n - 1, f, u, t);
        System.Console.WriteLine(f + " --> " + t);
        doHanoi(n - 1, u, t, f);
      }
    }

    [STAThread]

    static void Main(string[] args)
    {
      if (args.Length != 1) 
      {
        System.Console.WriteLine("usage: hanoi <number>");
        System.Environment.Exit(1);
      }

      int n = System.Convert.ToInt32(args[0]);

      if ((n < 1) || (n > 10)) 
      {
        System.Console.WriteLine("usage: hanoi <number> /* 1 <= number <= 10 */");
        System.Environment.Exit(1);
      }

      doHanoi(n, "1", "3", "2");

      System.Environment.Exit(0);
    }
  }
</number></number>