資源簡介
N皇后問題的啟發式算法,N可為任意數.
N皇后問題的啟發式算法,N可為任意數.
代碼片段和文件信息
????#include?
????#include?
????#include?
????#include?
????using?namespace?std;
????
????void?n_queens(int?int[]);
????void?random_permutation(int?int[]);
????void?swap(int[]?int?int);
????int?num_collision(int[]?int);
????
????int?main()?{
????
????int?num;
????
cout?<“number?of?queens:?“?;
????????cin?>>?num;?
????????cout?<???????
????????int?q[num];
????????
????????for?(int?i?=?0;?i? q[i]?=?i;
}
????????
????????//clock_t?startfinish;
????????//double?totaltime;
????????//start=clock();
????????n_queens(num?q);
????????
????????//finish=clock();
????????//totaltime=(double)(finish-start)/CLOCKS_PER_SEC;
????????//cout?<“\nTime?cost:?“?<???
????????
????????int?N?=?num;
????????
????????for?(int?i?=?0;?i?????????????for?(int?j?=?0;?j?????????????????if?(q[i]?==?j)?cout?<“Q?“;
????????????????else????????cout?<“*?“;
????????????}
????????????cout?<????????}??
????????cout?<?????????
????????system(“pause“);
????????return?0;
????????
????????
}
????void?n_queens(int?num?int?q[]){
int?collision?=?0;
????????int?swaps;
????????do{
????????random_permutation(num?q
- 上一篇:C語言 文件壓縮和解壓
- 下一篇:jacobi符號計算
評論
共有 條評論