Parallel Implementations of Candidate Solution Evaluation Algorithm for N-Queens Problem

Algorithm 1

Calculation conflicts with single-threaded CPU.

	Input:
	Output:
(1)	conflict 0;
(2)	for i = 0; i ¡ N; ++I do
(3)	for j = i + 1; j < N; ++j do
(4)	if = = j–i then
(5)	conflict++;
(6)	end
(7)	end
(8)	end