Queens problem

[eyesofhope]

Well... this is the N queens problem... I'm using 5 queens because it is small and I have couts showing me each step so I can see where I'm going wrong. I thought I was checking thoroughly, but the queens just keep stacking in the left most column. I'm assuming a bool would fix that... but I just need help on where to put it and what to put in it? I thought by "drawing" out the paths and the queens, I could avoid them stacking... Sorry it's such a long code, but I sincerely appreciate any help! The extra couts and displayBoard functions are a really helpful visual tool to see what's going wrong.


_{compiled in Visual C++ 2008 Express}

#include <iostream>
using namespace std; 

void displayBoard(int board[][5]);
void placeQueen(int board [][5]);
int findColumn(int row, int board[][5]);
void findHorizontalPath(int row, int column, int board[][5]);
void findVerticalPath(int row, int column, int board[][5]);
void findNEPath(int row, int column, int board[][5]);
void findSEPath(int row, int column, int board[][5]);
void findSWPath(int row, int column, int board[][5]);
void findNWPath(int row, int column, int board[][5]);
void findEmpty(int board[][5]);


int main()
{
	int board[5][5];
	
	findEmpty(board);
	cout << "Find empty" << endl;
	displayBoard(board);

	placeQueen(board);
	cout << "Place Queen" << endl;
	displayBoard(board);




}
void displayBoard(int board[][5])
{
	char show = ' ';
	for(int i = 0; i < 5; i++)
	{
		cout << endl;
		for(int j = 0; j < 5; j++)
		{
			switch(board[i][j])
			{
			case 0:
				show = 'e';
				break;
			case 1:
				show = 'Q';
				break;
			case 2:
				show = 'X';
				break;
			}

			cout << " " << show << " ";
		}
	}
}

void placeQueen(int board[][5])
{
	int  row = 0,column = 0;
	for(int i = 0; i < 5; i++)
	{
		row = i;
		column = findColumn(row, board);
		board[row][column] = 1;
		cout << "horizontal" << endl;
		findHorizontalPath(row,column,board);
		displayBoard(board);

		cout << "vertical" << endl;
		findVerticalPath(row,column,board);
		displayBoard(board);

		cout << "ne" << endl;
		findNEPath(row, column, board);
		displayBoard(board);

		cout << "se" << endl;
		findSEPath(row, column, board);
		displayBoard(board);

		cout << "sw" << endl;
		findSWPath(row, column, board);
		displayBoard(board);

		cout << "nw" << endl;
		findNWPath(row, column, board);
		displayBoard(board);
	}


}

int findColumn(int row, int board[][5])
{
	int temp = -1;
	for(int i = 0; i < 5; i++)
	{
		board[row][i];
		if(temp != 1 && temp != 2)
			return i;
	}

}
void findHorizontalPath(int row, int column, int board[][5])
{
	for(int i = 0; i < 5; i++)
	{
		if(board[row][i] != 1)
			board[row][i] = 2;

	}
}
void findVerticalPath(int row, int column, int board[][5])
{
	for(int i = 0; i < 5; i++)
	{
		if(board [i][column] != 1)
			board [i][column] = 2;
	}
}
void findNEPath(int row, int column, int board[][5])
{ 
	for(int j=row-1, k = column+1 ;j >= 0; --j, k++)  
    {
        if(board[j][k] != 1)
            board[j][k] = 2;
    }
}
void findSEPath(int row, int column, int board[][5])
{
     for(int j=row+1, k = column+1 ;j < 5; j++, k++)  
    {
        if(board[j][k] != 1)
            board[j][k] = 2;
    }
}
void findSWPath(int row, int column, int board[][5])
{
     for(int j=row+1, k = column-1 ;k >= 0; j++, --k)  
    {
        if(board[j][k] != 1)
            board[j][k] = 2;
    }
}
void findNWPath(int row, int column, int board[][5])
{
    for(int h= row-1, i = column-1 ;h >= 0; --h, --i)  
    {
        if(board[h][i] != 1)
			board[h][i] = 2;
    }
 
   
}

void findEmpty(int board[][5])
{
	int checkMatrix;
	for(int i = 0; i < 5; i++)
	{
		for(int j = 0; j < 5; j++)
		{
			checkMatrix = board[i][j];
			if(checkMatrix != 1 || checkMatrix != 2)
				board[i][j] = 0;
		}
	}
}

[eyesofhope]

Bump. I'm pretty sure my main problem lies in the "int findColumn" function.

[eyesofhope]

I added this function, but my queens are still stacking in the first column... :(

called in findColumn:

int findColumn(int row, int board[][5])
{
	for(int i = 0; i < 5; i++)
	{
		if(isSafe(row, i, board))
			return i;
	}

}

new function

bool isSafe(int row, int column, int board[][5])
{
	int checkRow;
	int checkColumn;
	int checkDiagonal;
	//check if vertical and horizontal is safe
	for(int i = 0; i < 8; i++)
	{
		checkRow = board[row][i];
		checkColumn = board[i][column];
		if(checkRow != 0 || checkColumn != 0)
			return false;
	}
	//check if NE is safe
	for(int j=row-1, k = column+1 ;j >= 0; --j, k++)  
    {
		checkDiagonal = board[j][k];
		if(checkDiagonal != 0)
			return false;
    }
	//check if SE is safe
	for(int a=row+1, b = column+1 ;a < 5; a++, b++)  
    {
		checkDiagonal = board[a][b];
        if(checkDiagonal != 0)
            return false;
    }
	//check if SW is safe
	for(int c=row+1, d = column-1 ;d >= 0; c++, --d)  
    {
		checkDiagonal = board[c][d];
        if(checkDiagonal != 0)
			return false;
    }
	//check if NW is safe
	for(int e= row-1, f = column-1 ;e >= 0; --e, --f)  
    {
		checkDiagonal = board[e][f];
        if(checkDiagonal != 0)
			return false;
    }

	return true;


}