Description: Optimized for N queens problem, you can calculate the Queen in a relatively short period of time means the number of ordered
To Search:
- [newmatrix] - collected in the latest foreigner to wri
- [VisualQueen] - n Queens Problem Solving (8 <= n <= 1000
- [DIJKstra] - Dijkstra shortest path data structure de
- [Camera-Thesis] - USB CAMERA THESIS. VERY USEFUL
- [quicksort] - this is a C programme writed by C.
File list (Check if you may need any files):
N皇后问题优化算法.cpp
Download