新建 文本文档.txt

用分支界限法实现的n后问题 vc++ 语言效率很好

int i;
father1=father
guard=new mid();
while(father!=-1)
{
	guard=x[father1];
	if(absnum(row-guard.row)==absnum(column-guard.column) || column=guard.column )
		return false;
	father1=guard.fathar;
}
return true;