Function main

CPP/recursion/N_Queens/N_Queens.cpp:113–137

}

int main()
{

    int n = 0;
    // Input Size of the chessboard
    // No of queens will be the same as size n.
    std::cin >> n;
    if (n <= 3)
    {
        std::cout << "No solution exists for n = " << n << std::endl;
    }
    // 2D vector for storing board having size max size of nXn.
    // First create a column vector of size n.
    std::vector<int> column(n);
    // Create Row vectors and fill rows with columns.
    std::vector<std::vector<int>> board(n, column);

    // Function call for
    // Arguments passed are : 2D vector board
    //                      : No of queens
    //                      : Starting row.
    N_Queens(board, n, 0);

    return 0;
}