int queens(int level) { if (!promising(level)) return 0; else if (level==N) return 1; int sum = 0; for (int i=1; i<=N; i++){ cols[level+1] = i; sum += queens(level+1)); } return sum; }