loop program

[javanovoice]

Hi,

I'm novoice to java. I'm trying a program for place 8 X’s on the board with 64 boxes(8*8 matrix) in such a way that:

[JosAH]

public static int testconstraints(char[][] board,int rowCheck, int colCheck)
{
System.out.println("Row :" + rowCheck + " Column : " + colCheck);

if(board[rowCheck][0]=='X' || board[rowCheck][1]=='X' ||board[rowCheck][2]=='X' ||board[rowCheck][3]=='X' ||board[rowCheck][4]=='X' ||board[rowCheck][5]=='X' ||board[rowCheck][6]=='X' ||board[rowCheck][7]=='X' )
{
if(board[0][colCheck]=='X' || board[1][colCheck]=='X' || board[2][colCheck]=='X' || board[3][colCheck]=='X' || board[4][colCheck]=='X' || board[5][colCheck]=='X' || board[6][colCheck]=='X' || board[7][colCheck]=='X' )
{
res= 1;
}
}
else
{
res = 0;
}
return 0;
}
}

That method basically does this:

public static int testconstraints(char[][] board,int rowCheck, int colCheck) {
   // al whole lot of mumbo jumbo and finally:
   return 0;
}

That isn't of much use is it? To speed your development up a bit, google for 'eight queens problem' because that's what you're trying to solve.

kind regards,

Jos

[Tolls]

Can I suggest you learn about indenting your code correctly?
That's painful to read at the moment.

At least you've got your naming mostly correct.

[javanovoice]

Hi JosAH,

Thanks for your suggestion. But i couldn't understand that 8 queen program code.

Please help me to solve my program..

[Norm]

The queen is the most powerful chess piece. The 8 queens problem is about how to place the queens on the board so none of them threaten another one.

To solve your problem you need a method that tests if a square is on the same row, column or diagonal of an occupied square.

[javanovoice]

Can you please suggest any idea about the method to test the constraints?

I have been trying to find that trick for last two days..

Please help me sir...

[Norm]

Given a square's x,y
Compute all the squares on the same row (ie row = x)
Compute all the squares on the same col (ie col = y)
Compute all the squares on the upperleft-lowerrright diag (take a piece of paper and work it out
0,0 -> 1,1 -> 2,2 -> ... 7,7
Compute all the squares on the upperright-lowerleft diag (same idea as above)
0,7 -> 1,7 -> ... 7,0

[javanovoice]

is this code somewhat correct?

it checks the rows and columns

if(board[rowCheck][0]=='X' || board[rowCheck][1]=='X' ||board[rowCheck][2]=='X' ||board[rowCheck][3]=='X' ||board[rowCheck][4]=='X' ||board[rowCheck][5]=='X' ||board[rowCheck][6]=='X' ||board[rowCheck][7]=='X' )
{
if(board[0][colCheck]=='X' || board[1][colCheck]=='X' || board[2][colCheck]=='X' || board[3][colCheck]=='X' || board[4][colCheck]=='X' || board[5][colCheck]=='X' || board[6][colCheck]=='X' || board[7][colCheck]=='X' )
{

sorry, if my question is silly...

actually, row and column is selected randomly and then checks for the constraints to place 'X' in that place...

[Norm]

Write a test program to compile and execute it and let the computer tell you if it is correct.
I might use a loop vs having the long conditions in the if statements

[javanovoice]

till now, I didn't get any idea for solving this problem.

I lost.........

[javanovoice]

Hi Norm,

Can you give the code for this problem?

[Norm]

Your code will work for the rows and columns, now you need to work out the algorithm for the diagonals.
I have never written code for this problem so I have nothing to give except some ideas.
Take a piece of paper and see how to vary the row and column values to go on each diagonal and how to detect when you are at the edge of the board.

[Junky]

java Loop program to place distinct value in a row, column and diagonal

Duplicate post