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.

Debug
.....\Queens.exe
queens.cpp
Queens.dsp
Queens.dsw
Queens.ncb
Queens.opt
Queens.plg
利用启发式修补解N 皇后问题.doc

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．