问递归地尝试解决皇后挑战，但得到了一个奇怪的输出

EN

private boolean placeQueen(int row, int column)
{
    if(check(row, column))
    {
        board[column][row] = 'Q';
        queenCount++;
        return true;
    }else if(column == board.length)
    {
        queenCount++;
        return false;
    }else
    {
        return (placeQueen(row, column + 1));
    }
    //return false;
}

private boolean check(int row, int column)
{
    //checking vertical axis
    for(int i = 0; i < board.length; i++)
    {
        if(board[column][i] == 'Q' && i != row)
        { //does not check its own row
            return false;
        }
    }

    int i = column;
    int j = row;
    //left one, up one
    while(i >= 0 && j >= 0)
    {
        try{
            if(board[i--][j--] == 'Q')
            {
                return false;
            }else
            {
                i--;
                j--;
            }
        }catch(ArrayIndexOutOfBoundsException e)
        {
            break;
        }
    }

    i = column;
    j = row;
    //right one, up one
    while(i <= 8 && j >= 0)
    {
        try{
            if(board[i++][j--] == 'Q')
            {
                return false;
            }else
            {
                i++;
                j--;
            }
        }catch(ArrayIndexOutOfBoundsException e)
        {
            break;
        }
    }

    return true;
}

Q * * * * * * * 
* Q * * * * * * 
* * * Q * * * * 
* * Q * * * * * 
* * * * * * * Q 
* * * * * * Q * 
* * * * Q * * * 
* * * * * Q * *

        public void run()
        {
             createBoard();
             while(queenCount != board.length)
             {
                 placeQueen(queenCount, 0);
             }
             printBoard();
        }