please do not use any data structure to finish this problem in java and you need to write a code to test your code.

public static boolean checkNQueensSolution(boolean[][] board):The N-queens problem is a classic puzzle in Computer Science, in which the objective is to place N queens on an NxN grid board such that no two queens attack each other, meaning that no two queens are placed on the same row, same column, or same diagonal. The function checkNQueensSolution returns true if the solution represented by board is valid and false otherwise. The argument board is a two dimensional Boolean array, where an entry is true if there is a queen there, and false otherwise.