need help with tower of hanoi logic

[heckorb]

I'm working on making a program that can solve a tower of hanoi with a given number of rings on it. My logic is faulty and the program eventually falls into an infinite loop where it moves the same ring between the same two pegs for eternity.

/*
Program solves the tower of hanoi logic puzzle.
Size of towers is determined by user.
Puzzle is solved using recursion.
Created by REDACTED.
Date Created: 10/27/2016
Date Last Modified: 11/2/2016
*/

#include "stdafx.h"
#include <iostream>
#include <Windows.h>
#include <vector>

using namespace std;

void print(const vector <vector<int>>&, const int);
void solve(vector <vector<int>>&, const int);
void performMove(vector <vector<int>>&, const int, const int, const int);
bool checkMove(const vector <vector<int>>&, const int, const int, const int);


int _tmain(int argc, _TCHAR* argv[])
{
	const int WIDTH = 3;
	int towerSize;
	int loop;
	int innerLoop;
	vector <vector<int>> towers;

	cout << "Please input the number of rings you want the program to solve.\n";
	cin >> towerSize;

	//set array size
	towers.resize(WIDTH);
	for (loop = 0; loop < WIDTH; loop++)
		towers.at(loop).resize(towerSize);
	

	//initialize vector of vectors
	for (loop = 0; loop < towerSize; loop++)
	{
		for (innerLoop = 0; innerLoop < WIDTH; innerLoop++)
		{
			if (innerLoop == 0)
				towers.at(innerLoop).at(loop) = loop + 1;
			else
				towers.at(innerLoop).at(loop) = 0;
		}
	}

	print(towers, towerSize);
	solve(towers, towerSize);

	system("pause");
	return 0;
}


void print(const vector <vector<int>> &towers, const int towerSize)
{
	int loop;
	int innerLoop;

	//clears previous iteration
	system("cls");
	//print vector of vectors contents
	for (loop = 0; loop < towerSize; loop++)
	{
		for (innerLoop = 0; innerLoop < 3; innerLoop++)
		{
			cout << towers.at(innerLoop).at(loop) << " ";
		}
		cout << endl;
	}
	//pause to allow user to see printed output
	Sleep(1000);
}


//solves tower of hanoi recursisvely
void solve(vector <vector<int>> &towers, const int towerSize)
{
	//variables go here
	//base case activates if solved
	if (towers.at(2).at(0) == 1)
		return;

	if (towerSize % 2 == 0)
	{
		//attempts to make valid move between pegs 1 and 2
		if (checkMove(towers, 0, 1, towerSize))
		{
			performMove(towers, 0, 1, towerSize);
			print(towers, towerSize);
		}
		else if (checkMove(towers, 0, 1, towerSize))
		{
			performMove(towers, 0, 1, towerSize);
			print(towers, towerSize);
		}

		//attempts to make valid move between pegs 1 and 3
		if (checkMove(towers, 0, 2, towerSize))
		{
			performMove(towers, 0, 2, towerSize);
			print(towers, towerSize);
		}
		else if(checkMove(towers, 2, 0, towerSize))
		{
			performMove(towers, 2, 0, towerSize);
			print(towers, towerSize);
		}

		//attempts to make valid move between pegs 2 and 3
		if (checkMove(towers, 1, 2, towerSize))
		{
			performMove(towers, 1, 2, towerSize);
			print(towers, towerSize);
		}
		else if (checkMove(towers, 2, 1, towerSize))
		{
			performMove(towers, 2, 1, towerSize);
			print(towers, towerSize);
		}
	}
	else
	{
		//attempts to make valid move between towers 1 and 3
		if (checkMove(towers, 0, 2, towerSize))
		{
			performMove(towers, 0, 2, towerSize);
			print(towers, towerSize);
		}
		else if (checkMove(towers, 2, 0, towerSize))
		{
			performMove(towers, 2, 0, towerSize);
			print(towers, towerSize);
		}

		//attempts to make valid move between towers 1 and 2
		if (checkMove(towers, 0, 1, towerSize))
		{
			performMove(towers, 0, 1, towerSize);
			print(towers, towerSize);
		}
		else if (checkMove(towers, 1, 0, towerSize))
		{
			performMove(towers, 1, 0, towerSize);
			print(towers, towerSize);
		}

		//attempts to make valid move between towers 3 and 2
		if (checkMove(towers, 2, 1, towerSize))
		{
			performMove(towers, 2, 1, towerSize);
			print(towers, towerSize);
		}
		else if (checkMove(towers, 1, 2, towerSize))
		{
			performMove(towers, 1, 2, towerSize);
			print(towers, towerSize);
		}
	}
	//goes to next 3 steps
	solve(towers, towerSize);
}


//moves ring from a given tower to another given tower.
void performMove(vector <vector<int>> &towers, const int moveFrom, 
	const int moveTo, const int towerSize)
{
	int loop = 0;
	int top1 = towerSize-1;
	int top2 = towerSize-1;

	//finds top of tower ring is to be moved from
	for (loop = 0; loop < towerSize - 1; loop++)
	{
		if (towers.at(moveFrom).at(loop) != 0)
			top1--;
	}

	//finds top of tower ring is to be moved to
	for (loop = 0; loop < towerSize - 1; loop++)
	{
		if (towers.at(moveTo).at(loop) != 0)
			top2--;
	}

	if (towers.at(moveTo).at(top2) == 0)
		towers.at(moveTo).at(top2) = towers.at(moveFrom).at(top1);
	else if (top2 > 0)
		towers.at(moveTo).at(top2 - 1) = towers.at(moveFrom).at(top1);

	towers.at(moveFrom).at(top1) = 0;
}


//checks that a move can be made between given towers
bool checkMove(const vector <vector<int>> &towers, const int moveFrom, 
	const int moveTo, const int towerSize)
{
	bool output = true;
	int loop = 0;
	int top1 = towerSize-1;
	int top2 = towerSize-1;

	//finds top of tower ring is to be moved from
	for (loop = 0; loop < towerSize-1; loop++)
	{
		if (towers.at(moveFrom).at(loop) != 0)
			top1--;
	}

	//finds top of tower ring is to be moved to
	for (loop = 0; loop < towerSize-1; loop++)
	{
		if (towers.at(moveTo).at(loop) != 0)
			top2--;
	}


	//if ring from first tower is larger than ring from second,
	//and second tower is not empty, change output to false
	if (towers.at(moveFrom).at(top1) > towers.at(moveTo).at(top2) &&
		towers.at(moveTo).at(towerSize-1) != 0)
		output = false;

	return output;
}

[SakurasouBusters]

Can you tell us the function that causes that problem?

[heckorb]

It's the series of if statements in the solve function, which I based off the first example on the wikipedia article for Tower of Hanoi