C / C++ / MFC

/******************************************	TOWER OF HANOI	**********************************************************/
#include <stdio.h>
#include <conio.h>
#include <ctype.h>

int find(int name);
int check(int temp[], int i);
void del(int name);
int repetetion(int temp[] , int name);
int indexing(int temp[]);

int m[3], r[3], l[3];
int mp=0, rp=0, lp=3 ;		//indicates the latest position occuipied

int main()
{
	int i=0;
	int temp=1, name;
	char position, answer;

	//initializing to 0
	while(i < 4)
	{
		l[i] = 4-i;
		m[i] = 0;
		r[i] = 0;
	}
	
	printf("\nWelcome to the towers of hanoi. . . \n\n");

	//looping until the left most tower have all the blocks in decending order.
	while((r[0] != 4 && r[1] != 3 && r[2] != 2 && r[3] != 1) && toupper(answer) == 'Y')
	{
		//taking name of the block to move.
		printf("\nEnter the block name:\n");
		scanf("%d", &name);
		find(name);

		//looping until correct block is moved.
		while(find(name) == 1){
			printf("This block cannot be moved! Please chose again. . .\n");
			scanf("%d", &name);
			find(name);
		}

		//taking the position of the tower to move the block in.
		printf("\n\nEnter the position you want to move it in..\n");
		scanf("%1s", &position);
		while(temp=1)
		{
			if(toupper(position)=='M'){
				if(find(name)==0 && (temp=repetetion(m, name))==0){		//if the block is movable and if the block is moved to different tower than the one it is in.
					del(name);				//del the block from that tower
					m[mp] = name;			//move that block to the prescripted one
					mp++;					//filling the block-space of that tower, hence 4-mp more blocks can be inserted.
					continue;
				}
			}
			else if(toupper(position) == 'L'){
				if(find(name)==0 && (temp =repetetion(l, name))==0){
					del(name);
					l[lp] = name;
					lp++;
					continue;
				}
			}
			else if(toupper(position) == 'R'){
				if(find(name)==0 && (temp = repetetion(r, name))==0){
					del(name);
					r[rp] = name;
					rp++;
					continue;
				}
			}

			printf("Invalid entry! Please enter again. . .");		//if the desired position is already occupied
			scanf("%1s", &position);
		}

		if( r[0] == 4 && r[1] == 3 && r[2] == 2 && r[3] == 1)
		{
			printf("\n\nYou have solved the HANOI TOWER PUZZLE. . .");
			printf("\n\nWant to play again? (Y/N)	");
			scanf("%1s", &answer);
		}
	}

	printf("\t\tTHANK YOU !");
	return 0;
}

//it's function is to fins the block position and if it is movable.
int find(int name)
{
	int i, temp;

	for(i=0; i<4; i++)
	{
		if(m[i]==name){
			temp = check(m, i);		//checks if it is movable
		}
		else if(l[i]==name){
			temp = check(l, i);
		}
		else if(r[i]==name){
			temp = check(r, i);
		}
	}

	return (temp);
}

//checks if the block is obstructed or not.
int check(int temp[], int i)
{
	if(i != indexing(temp))
		return(1) ;
	else if(i == indexing(temp))
		return(0) ;
}

//finds the size of the array
int indexing(int temp[])
{
	int count=0;
	while(temp[count]!= 0)
	{
		count++;
	}
	return(count) ;
}

//finds if the element to be moved is already at the required posotion
int repetetion(int temp[] , int name)
{
	int i, flag;
	for(i=0; i<4; i++)
	{
		if(temp[i] == name)
		{
			flag = 1;
			//printf("It's already there ")
			break;
		}
		else
		{
			flag = 0;
		}
	}

	return(flag);
}

//del the name from it's initial position.
void del(int name)
{
	int i;
	for(i=0; i<4; i++)
	{
		if(m[i]==name){
			m[i] = 0;
			mp--;
		}
		else if(l[i]==name){
			l[i] = 0;
			lp--;
		}
		else if(r[i]==name){
			r[i] = 0;
			rp--;
		}
	}
	return ;
}