Optimizing N-queen with openmp
I am learning OPENMP and wrote the following code to solve nqueens problem. //Full Code: https://github.com/Shafaet/Codes/blob/master/OPENMP/Parallel%20N- Queen%20problem.cpp int n; int call(int col,int rowmask,int dia1,int dia2) { if(col==n) { return 1; } int row,ans=0; for(row=0;row<n;row++) { if(!(rowmask & (1<<row)) & !(dia1 & (1<<(row+col))) & !(dia2 & (1<<((row+n-1)-col)))) { ans+=call(col+1,rowmask|1<<row,dia1|(1<<(row+col)), dia2|(1<<((row+n-1)-col))); } } return ans; } double parallel() { double st=omp_get_wtime(); int ans=0; int i; int rowmask=0,dia1=0,dia2=0; #pragma omp parallel