Description: We use the smallest conflict heuristic repair algorithm to seek the solution of N s, the beginning, N of Queen s one per line, the location is random. Then, in order to consider each line, with the offensive unit that s a few (in the line outside), marking out the line of each unit. The Queen s visit to the Queen that the smallest number of offensive units. Accordingly, the continuous line to the next, until you find the solution so far.
To Search:
File list (Check if you may need any files):
Download