//n Queen proc /** *

タイトル:

*

説明:

*

著作権: Copyright (c) 2003

*

会社名:

* @author 未入力 * @version 1.0 */ public class proc extends Thread{ boolean Up[]; boolean Dn[]; boolean Hrz[]; int Rslt[]; int m_SeqNum=0,Num=5; int TryNum=0; boolean Complete=false,m_Step=false;; Applet1 qn; public boolean stopF=false; public proc() { } public proc(Applet1 qn) { this.qn=qn; m_SeqNum=TryNum=0; m_Step=false; if(qn.checkbox1.getState()) m_Step=true; int i; Num=Integer.parseInt(qn.textField2.getText()); Up=new boolean[2*Num]; Dn=new boolean[40]; Hrz=new boolean[20]; Rslt=new int[20]; //System.out.println("Qtry "+Num+": "); //Num=6; for(i = 0; i7) m_Step=false; if(Complete){ //textArea1.setText(""); TryNum++; str +=" "+TryNum+"番目の解 \r\n"; } else { str +=" "+TryNum+"中間の解 \r\n"; } //printf(" \n%d th solution\n",SeqNum++); for(i = 0; i< Num;i++){ for(j= 0; j