J2ME中国象棋源码，决对可以正常运行！

package com.marko; import java.util.Random; public class Thinker extends Thread implements ChessDefine{ int BV1[]=new int[7]; int BV2[]=new int[7]; int BV3[]=new int[5]; // 卒在不同位置的价值 public final static int BA[][][]= { { { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, { 0, 2, 2, 3, 4, 4, 4, 3, 2, 2, 0}, { 0, 2, 2, 3, 4, 4, 4, 3, 2, 2, 0}, { 0, 1, 2, 3, 3, 3, 3, 3, 2, 1, 0}, { 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0}, { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0} }, { { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, { 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0}, { 0, 1, 2, 3, 3, 3, 3, 3, 2, 1, 0}, { 0, 2, 2, 3, 4, 4, 4, 3, 2, 2, 0}, { 0, 2, 2, 3, 4, 4, 4, 3, 2, 2, 0}, { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0} } }; private int m_nLevel; boolean m_bThinking; boolean m_bThinkOver; private Move m_moveResult; private Face m_FaceToThink; // movelists: int tman[][]=new int[6][125]; int ttox[][]=new int[6][125]; int ttoy[][]=new int[6][125]; int tcount[] =new int[6]; // face int tmanx[]=new int[32] ; int tmany[]=new int[32]; boolean tside; // map int tmap[][]=new int[11][12]; // int tlevel,tdeep; // 只在enumlist中调用 int lman,ltox,ltoy; ; int v1[]=new int[32]; int v2[][]=new int[32][32]; int v3[]=new int[32]; int v4[]=new int[32]; public final boolean NORED(int i,int j) { if(SideOfMan[tmap[i][j]]!=0){ return true; } else{ return false; } } public final boolean NOBLACK(int i,int j) { if(SideOfMan[tmap[i][j]]!=1){ return true; } else{ return false; } } public final boolean NOMAN(int i,int j) { if(tmap[i][j]==32){ return true; } else{ return false; } } public Thinker(){ ResetBV(); m_nLevel = 1; m_bThinking = FALSE; m_bThinkOver = FALSE; } public void Think(Face face){ m_FaceToThink=new Face(); m_FaceToThink.copy(face); m_bThinking = TRUE; m_bThinkOver = FALSE; } void ResetBV() { //BV1记录了每个子的价值，BV2记录了每个子机动性的权值，BV3记录兵在不同位置的权值 BV1[0]=0; BV2[0]=0; //帅 BV1[1]=250; BV2[1]=1; //士 BV1[2]=250; BV2[2]=1; //相 BV1[3]=300; BV2[3]=12; //马 BV1[4]=400; BV2[4]=6; //车 BV1[5]=300; BV2[5]=6; //炮 BV1[6]=100; BV2[6]=15; //兵 BV3[0]=0; BV3[1]=70; BV3[2]=90; BV3[3]=110; BV3[4]=120; } //若返回为空说明思考还没有结束或者错误； public Move getMove(Face facetothink) { //TRACE("Enter CThinker::GetMove()\n"); Move move=null; if(!m_bThinkOver) { //System.out.println("think is not over!"); return null; } if(facetothink!=m_FaceToThink) { move=m_moveResult; m_bThinkOver=false; return move; } System.out.println("getmove error!"); return null; } public void setLevel(int level) { m_nLevel=level; } public void run(){ int i,cur,curvalue; //curvalue为棋局评价值，cur为棋子代号 int maxvalue[]=new int[3]; Move maxmove[]=new Move[3]; for(int j=0;j<3;j++){ maxmove[j]=new Move(); } while(true) { try { Thread.sleep(100); } catch (InterruptedException e) { // TODO Auto-generated catch block e.printStackTrace(); } if(!m_bThinking) { continue; } curvalue=-10000; maxvalue[0]=-10000; maxvalue[1]=-10001; maxvalue[2]=-10002; tlevel = m_nLevel; tdeep =0; // bman=tman[0]; // btox=ttox[0]; // btoy=ttoy[0]; tcount[tdeep]=0; for(i=0;i<32;i++) { tmanx[i]=m_FaceToThink.man[i].x; tmany[i]=m_FaceToThink.man[i].y; } tside=m_FaceToThink.side; m_FaceToThink=fixManMap(m_FaceToThink,tmap); cur=0; EnumList(); //列举双方现有局面所有子下一步可能的走法，将走法放入tman，ttox,ttoy中 //System.out.println("tcount[0]1="+tcount[0]); while(cur<tcount[0]){ curvalue=SubThink(tman[0][cur],ttox[0][cur],ttoy[0][cur]); //System.out.println("tcount[0]2="+cur); //防止兑子过快: if(tmap[ttox[0][cur]][ttox[0][cur]]!=32){ //System.out.println("cur="); curvalue-=BV1[4]/18; } // System.out.println("man="+tman[0][cur]+",curvalue="+curvalue+",("+tmanx[tman[0][cur]]+","+tmany[tman[0][cur]]+ // ")--("+ttox[0][cur]+","+ttoy[0][cur]+")"); //找出前三个最大的分别放入maxvalu[0-2]中 if(curvalue >maxvalue[0]) { maxmove[2].copy(maxmove[1]); maxvalue[2]=maxvalue[1]; maxmove[1].copy(maxmove[0]); maxvalue[1]=maxvalue[0]; maxmove[0].man=tman[0][cur]; maxmove[0].x=ttox[0][cur]; maxmove[0].y=ttoy[0][cur]; maxvalue[0]=curvalue; } else if(curvalue >maxvalue[1]) { maxmove[2].copy(maxmove[1]); maxvalue[2]=maxvalue[1]; maxmove[1].man=tman[0][cur]; maxmove[1].x=ttox[0][cur]; maxmove[1].y=ttoy[0][cur]; maxvalue[1]=curvalue; } else if(curvalue >maxvalue[2]) { maxmove[2].man=tman[0][cur]; maxmove[2].x=ttox[0][cur]; maxmove[2].y=ttoy[0][cur]; maxvalue[2]=curvalue; } cur ++; } // 结束一次计算: //计算前3个最大的结果是否接近，要是接近就随即选择，若区别较大则选用最大的 //System.out.println(maxmove[0].man+" 1 "+maxmove[0].x+" "+maxmove[0].y); //System.out.println(maxmove[1].man+" 2 "+maxmove[1].x+" "+maxmove[1].y); // for(int p=0;p<3;p++){ // System.out.println(maxvalue[p]); // } //System.out.println("--------------------------------------------------------"); int f; if((maxvalue[0]+maxvalue[1]+maxvalue[2])==0){ f=100; }else{ f=(((maxvalue[0]-maxvalue[2])*100)/((maxvalue[0]+maxvalue[1]+maxvalue[2])/3)); } if(f<10 && f>-10) m_moveResult=maxmove[rnd(3)]; else { if((maxvalue[0]+maxvalue[1])==0){ f=100; }else{ f=((maxvalue[0]-maxvalue[1])*100)/((maxvalue[0]+maxvalue[1])/2); } if(f<10 && f>-10){ m_moveResult=maxmove[rnd(2)]; }else{ //System.out.println("f="+maxvalue[0]); m_moveResult=maxmove[0]; } } //System.out.println("Result:"+m_moveResult.man+" ("+m_moveResult.x+","+m_moveResult.y+")"); m_bThinking=false; m_bThinkOver=TRUE; // ------------------------- for(i=0;i<32;i++) { m_FaceToThink.man[i].x=tmanx[i]; m_FaceToThink.man[i].y=tmany[i]; } m_FaceToThink.side=tside; // ------------------------------- //System.out.println(m_moveResult.man+" "+m_moveResult.x+" "+m_moveResult.y); } } private int boolToInt(boolean b){if(!b)return 0;return 1;} private boolean intToBool(int i){if(i==0)return false;return true;} // 将改子man能走的位置（tx,ty）加入队列 private boolean ADD(int man,int tx,int ty) { tman[tdeep][lman]=man; ttox[tdeep][ltox]=tx; ttoy[tdeep][ltoy]=ty; lman++; ltox++; ltoy++; tcount[tdeep]++;