// return type will be a vector<int>
    vector<int> nextLegalPosition(vector<int> board, int n){
        // If the given position is not legal, find the next legal position in the row. If there is not, find one in the next row. Or need to backtrack? That would kinda make more sense.
        // TODO: Could go ask TA about that.

        printBoard(board);
        vector<int> lastPosition = findLastPosition(board);

        if(findLastPosition(board)[0] == board.size()){
            // the board is full.
            cout << "The board is full!";
            // If the position is not legal, look for another. If you can't find one, backtrack.
            cout << "\np1: " << findLastPosition(board)[0] << "\n";
            cout << "\np2: " << findLastPosition(board)[1] << "\n";
            cout << "\nBoardsize" << board.size() << "\n";
            //cout << "board" << board[7];
            if(!isLegalPosition(board)){
                // This one can be less than, we don't need to check the earlier ones, we know they already are.
                for(int col = findLastPosition(board)[1]; col < board.size(); col++){
                    vector<int> newBoard = board;
                    cout << "\nlast col: " << col << "\n";
                    newBoard[board.size()] = col;
                    if(isLegalPosition(newBoard)){
                        cout << "this find last position board 1 works!\n";
                        printBoard(newBoard);
                        return newBoard;
                    }
                }
                vector<int> newBoard = board;
                newBoard[lastPosition[0]] = findLastPosition(board)[1];
                backtrackLegalSolution(newBoard, lastPosition[0] - 1);
            }
            else if(isLegalPosition(board)){
                cout << "el board " << board[board.size() - 1] << " - " << findLastPosition(board)[1] << "\n";
                if(findLastPosition(board)[1] == board[board.size() - 1]){
                    cout << "at edge\n";
                }
                else{
                    for(int col = findLastPosition(board)[1]; col < board.size(); col++){
                        vector<int> newBoard = board;
                        cout << "\nlast col 2: " << col;
                        newBoard[board.size()] = col;
                        if(isLegalPosition(newBoard)){
                            cout << "this find last position board 2 works!\n";
                            printBoard(newBoard);
                            return newBoard;
                        }
                    }
                }
                    vector<int> newBoard = board;
                    newBoard[lastPosition[0]] = 0;
                    backtrackLegalSolution(newBoard, lastPosition[0] - 1);
                }
        }
        else if(!isLegalPosition(board)){
            cout << "Last position val: " << lastPosition[1] << "\n";
            // lastPosition[0] is the index
            for(int col = 1; col < board.size() + 1; col++){
                vector<int> newBoard = board;
                cout << "col: " << col;
                // newBoard at the row (lastPosition[0]), is equal to the value of the column.
                newBoard[lastPosition[0]] = col;
                if(isLegalPosition(newBoard)){
                    cout << "\nThis board works\n";
                    printBoard(newBoard);
                    return newBoard;
                }

            }
            vector<int> newBoard = board;
            // TODO: Do I need to change this to one?
            newBoard[lastPosition[0] - 1] = board[lastPosition[0] - 1] + 1;
            // If the number is eight, meaning all other things have been checked in this, look for another solution.
            if(!(board[lastPosition[0] - 1] == board.size())){
                newBoard[lastPosition[0] - 1] = 0;
            }
            newBoard[lastPosition[0]] = 0;
            backtrackLegalSolution(newBoard, lastPosition[0]);


        }
        // TODO: Need to figure out what is happening with a full board. I have partial boards working, I think.
        // need to figure out if a board is finished, maybe if findLastPosition[0] is the size of the board, I would have to check this first.
        else if(isLegalPosition(board)){
            // Need to go down a row now, in addition to the column.
            int nextRow = lastPosition[0] + 1;
            // TODO: There has to be a more efficient way than checking these possibilities
            for(int col = 1; col < board.size() + 1; col++){
                vector<int> newBoard = board;
                cout << "col2: " << col;
                // newBoard at the row (lastPosition[0]), is equal to the value of the column.
                newBoard[nextRow] = col;
                if(isLegalPosition(newBoard)){
                    cout << "\nThis board works 2\n";
                    printBoard(newBoard);
                    return newBoard;
                }
            }
            vector<int> newBoard = board;

            newBoard[lastPosition[0] - 1] = board[lastPosition[0] - 1] + 1;
            // If the number is eight, meaning all other things have been checked in this, look for another solution.
            if(!(board[lastPosition[0] - 1] == board.size())){
                newBoard[lastPosition[0] - 1] = 0;
            }
            newBoard[lastPosition[0]] = 0;
            backtrackLegalSolution(newBoard, lastPosition[0]);

        }
        return {0};
    }