五子棋源代码-Java_Applet小程序.docVIP

importjava.applet.Applet; importjava.awt.*; importjava.util.Random; public class wzq extends Applet implements Runnable { public void stop() { LoopThread = null; } privateintCalcZi(inti, int j, byte byte0) { CXY cxy = new CXY(); int k = 0; int l = 0; do { int i1 = 0; int j1 = 0; do { cxy.x = i; cxy.y = j; if(MoveAGrid(cxy, l + 4 * j1) QiPan[cxy.x][cxy.y] == byte0) do { if(QiPan[cxy.x][cxy.y] == 0 || QiPan[cxy.x][cxy.y] != byte0) break; i1++; } while(MoveAGrid(cxy, l + 4 * j1)); } while(++j1 2); if(i1 k) k = i1; } while(++l 4); return ++k; } privatebooleanCanDo() { return steps ((GRIDSUM * GRIDSUM) / 100) * 80; } //电脑下棋 privateintCPUDo(CXY cxy, byte byte0) { intai[] = new int[2]; int ai1[] = new int[2]; int ai2[] = new int[2]; boolean flag = false; EnterTimes++; ai2[0] = 0; for(inti = recLU.x; i= recRD.x; i++) { for(int k = recLU.y; k = recRD.y; k++) { int l = 0; if(QiPan[i][k] == 0) { DoAStep(i, k, byte0); l = CalcCPU(i, k, byte0); } if(l 0) { int i1 = 0; byte byte1; if(byte0 == 1) byte1 = 2; else byte1 = 1; if(EnterTimes= level steps ((GRIDSUM * GRIDSUM) / 100) * 80) i1 = CPUDo(cxy, byte1); l += i1; if(l + Math.abs(rd.nextInt()) % 5 ai2[0] || !flag) { ai[0] = i; ai1[0] = k; ai2[0] = l; flag = true; } QiPan[i][k] = 0; } } } if(EnterTimes= 1) { cxy.x = ai[0]; cxy.y = ai1[0]; int j = 0; do { try { Thread.sleep(300L); } catch(InterruptedException _ex) { } QiPan[cxy.x][cxy.y] = byte0; repaint(); try { Thread.sleep(300L); } catch(InterruptedException _ex) { } QiPan[cxy.x][cxy.y] = 0; repaint();