#include "blocks_main.h"

#include <iostream>
#include <string>
#include <stdio.h>
#include <ctime> 
#include <cstdlib>


using namespace std;

int main(void){
		int move_counter =0;
		int init =1;
		int init2=1;
		int bottom1 = 2;
		int bottom2 = 3;
		int stack1_top =0;
		int stack2_top=0;
		int stack1_length = 4;
		int stack2_length = 3;
		int iTable=0;
	  //set up arrays to hold our values
		char blocks_stack1[5];
		char blocks_stack2[5];
		char table_stack[10];
		char final_stack1[5];
		char final_stack2[5];
		char temp_stack1[5];
		char temp_stack2[5];
	
	
	//set up the example problem
	blocks_stack1[0]= 'F';
	blocks_stack1[1]= 'C';
	blocks_stack1[2]= 'A';
	blocks_stack1[3]= 'G';

	blocks_stack2[0]= 'D';
	blocks_stack2[1]= 'B';
	blocks_stack2[2]= 'E';


	final_stack1[0] = 'D';
	final_stack1[1] = 'A';
	final_stack1[2] = 'G';

	final_stack2[0] = 'C';
	final_stack2[1] = 'F';
	final_stack2[2] = 'B';
	final_stack2[3] = 'E';


	cout<<"Hueristic 1"<<endl;

	for(int i=0; i< 4; i++)
	{    
		table_stack[i] = blocks_stack1[i];
		cout<<table_stack[i]<<" On the Table"<<endl;
		move_counter++;
	}

	for(int j=4; j<7; j++)
	{
		table_stack[j] = blocks_stack2[j-4];
	    cout<<table_stack[j]<<" On the Table"<<endl;
		move_counter++;
	}

	while(1)
	{
		while(bottom1 >= 0 || bottom2 >= 0)
		{
			for(int i=0; i < 10; i++)
			{
				if(final_stack1[bottom1]==table_stack[i])
				{	
					temp_stack1[bottom1] = table_stack[i];
					table_stack[i] = NULL;
				
					cout<<temp_stack1[bottom1]<<" Final State"<<endl;
					bottom1--;
					move_counter++;
				}//end if for stack 1 check

			}//end for loop for finalstack 1


			for(int i=0; i < 10; i++)
			{
				if(final_stack2[bottom2]==table_stack[i])
				{
					temp_stack2[bottom2] = table_stack[i];
					table_stack[i] = NULL;
				
					cout<<temp_stack2[bottom2]<<" Final State"<<endl;
					bottom2--;
					move_counter++;
				}//end if for stack 2 check

			}//end for loop for finalstack 2
		}//end while that keeps us checking


		if(init)
		{
		cout<<"Finished Hueristic 1"<<endl;
		cout<<"Hueristic 1 Moves: "<<move_counter++<<endl;
		init =0;

		//init second heuristic
		bottom1 = 2;
		bottom2 = 3;
		move_counter =0;

		cout<<""<<endl;
        cout<<"Hueristic 2"<<endl;
		}//end of heuristic 1
      

		
		

		while(bottom1 >=0 || bottom2>=0)
		{
			//check first stack against final 1st
			if(blocks_stack1[stack1_top] == final_stack1[bottom1])
			{
                temp_stack1[bottom1] = blocks_stack1[stack1_top];
				cout<<temp_stack1[bottom1]<<" Final State"<<endl;
				stack1_top++;
				bottom1--;
				move_counter++;
				stack1_length--;

			}//check first stack against final 2nd
			else if (blocks_stack1[stack1_top] == final_stack2[bottom2])
			{
                temp_stack2[bottom2] = blocks_stack1[stack1_top];
				cout<<temp_stack2[bottom2]<<" Final State"<<endl;
				stack1_top++;
				bottom2--;
				move_counter++;
				stack1_length--;


			} //check second stack against final first
			else if (blocks_stack2[stack2_top] == final_stack1[bottom1])
			{
				temp_stack1[bottom1] = blocks_stack2[stack2_top];
				cout<<temp_stack1[bottom1]<<" Final State"<<endl;
				stack2_top++;
				bottom1--;
				move_counter++;
				stack2_length--;

			}//check second stack against final 2nd
			else if (blocks_stack2[stack2_top] == final_stack2[bottom2])
			{
				temp_stack2[bottom2] = blocks_stack2[stack2_top];
				cout<<temp_stack2[bottom2]<<" Final State"<<endl;
				stack2_top++;
				bottom2--;
				move_counter++;
				stack2_length--;

			}
			else //deal with table
			{
				int table_check =0;
				//first deal with table array
				for(int i=0; i < 10; i++)
					{
						if(final_stack1[bottom1]==table_stack[i])
						{
							temp_stack1[bottom1] = table_stack[i];
							table_stack[i] = NULL;
				
							cout<<temp_stack1[bottom1]<<" Final State"<<endl;
							bottom1--;
							move_counter++;
						}
						else
							table_check++;

					}//end for loop for finalstack 1


					for(int i=0; i < 10; i++)
					{
						if(final_stack2[bottom2]==table_stack[i])
						{
							temp_stack2[bottom2] = table_stack[i];
							table_stack[i] = NULL;
				
							cout<<temp_stack2[bottom2]<<" Final State"<<endl;
							bottom2--;
							move_counter++;
						}
						else
							table_check++;

					}//end stack for loop


				if(table_check==20)//must table a block
				{
					if(stack1_length >= stack2_length)
					{
						table_stack[iTable] = blocks_stack1[stack1_top];
						cout<<table_stack[iTable]<<" On the Table"<<endl;
						move_counter++;
						stack1_top++;
						stack1_length--;
						iTable++;
					}
					else if(stack2_length > stack1_length)
					{
						table_stack[iTable] = blocks_stack2[stack2_top];
						cout<<table_stack[iTable]<<" On the Table"<<endl;
						move_counter++;
						stack2_top++;
						stack2_length--;
						iTable++;
					}
					


				}//ends tableing 

			}//ends dealing with all table data
		}//end last while

        if(init2)
		{
		cout<<"Finished Hueristic 2"<<endl;
		cout<<"Hueristic 2 Moves: "<<move_counter++<<endl;
		init2 =0;
		}//end of heuristic 1







	}//end while


	

}//end function