/*
 *  Copyright (C) 2009  E.Albert, P.Arenas, S.Genaim, G.Puebla, and D.Zanardini
 *                      https://costa.ls.fi.upm.es
 *
 *  This program is free software: you can redistribute it and/or modify
 *  it under the terms of the GNU General Public License as published by
 *  the Free Software Foundation, either version 3 of the License, or
 *  (at your option) any later version.
 *
 *  This program is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *  GNU General Public License for more details.
 *
 *  You should have received a copy of the GNU General Public License
 *  along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */
package pubs;
/**
 * A recursive implementation of the Hanoi towers problem.
 * 
 * @author E.Albert, P.Arenas, S.Genaim, and G.Puebla
 *
 */
public class Hanoi {

	public Hanoi() {
	}

	static void hanoi(int n, int t, int f, int u)
	{
		if (n > 0) {
			hanoi(n-1, u, f, t);
			hanoi(n-1, t, u, f);
		}
	}

	public static void main(String[] args) {

		// First test
		int test = 10;
		
		hanoi(test,1,2,3);

		// This two tests growth too higher
		/*test = 50;
		
		hanoi(test,1,2,3);

		test = 100;
		
		hanoi(test,1,2,3);*/
		
	}

}