Recursion made simple

namespace Recursion
{
    //Tower of Hanoi Example
    //Tower of Hanoi problem: Given three pegs, one with a set of N disks of increasing size, 
    //determine the minimum (optimal) number of steps it take to move all the disks from their 
    //initial position to another peg without placing a larger disk on top of a smaller one.
    class TowerofHanoi
    {
        static int depth;
        public TowerofHanoi() { }
        public int DoDiskMovements(int disks)
        {
            depth++;
            if (depth == 1)
            {
                if (disks <= 0)
                    return 0;
            }
            if (disks == 1 )
            {
                return 1;
            }
            else
            {
                return 2 * DoDiskMovements(disks - 1) + 1;
            }
        }
    }
}