queenslv.cpp

随机算法

// QueensLV.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include "iostream.h"
#include "time.h"

#include "Queen.h"
int node;
void nQueen(int n)
{
	CQueen X;
	X.n=n;
	int *p=new int [n+1];
	for(int i=0;i<=n;i++)
		p[i]=0;
	X.x=p;
	while(!X.QueensLV());//直到找到

	cout<<"The positions are:"<<endl;
	for(i=1;i<=n;i++)
		cout<<p[i]<<"   ";
	cout<<endl;
	
	cout<<"-----------------------------------------------------------------"<<endl;
	for(i=1;i<=n;i++)
	{
		for(int j=1;j<=n;j++)
		{
			if(j==p[i])
				cout<<"1  ";
			else
				cout<<"0  ";
		}
		cout<<endl;
	}
	cout<<"-----------------------------------------------------------------"<<endl;
	delete []p;
}
void main()
{
	int n;
	clock_t start,finish;
	cout<<"Please enter the number of queens:"<<endl;
	cin>>n;
	start=clock();

	nQueen(n);
	finish=clock();
	double time=(double)(finish - start) / CLOCKS_PER_SEC;

    cout<<n<<"-queens problem uses "<<time<<" seconds"<<endl;
	cout<<"Successful(last) time total nodes:"<<node<<endl;
	return;
}