五子棋人機對弈程式碼——java版 阿新 • • 發佈：2019-01-20 演算法是窮舉遞迴法，只不過用java重新寫了一遍 import java.awt.Color; import java.awt.Container; import java.awt.Graphics; import java.awt.event.ActionEvent; import java.awt.event.ActionListener; import java.awt.event.MouseEvent; import java.awt.event.MouseListener; import java.awt.event.MouseMotionListener; import java.awt.event.WindowAdapter; import java.awt.event.WindowEvent; import javax.swing.ButtonGroup; import javax.swing.JFrame; import javax.swing.JMenu; import javax.swing.JMenuBar; import javax.swing.JMenuItem; import javax.swing.JOptionPane; import javax.swing.JPanel; import javax.swing.JRadioButtonMenuItem; import javax.swing.SwingUtilities; import javax.swing.UIManager; /* *main方法建立了ChessFrame類的一個例項物件（cf）， *並啟動螢幕顯示顯示該例項物件。 * **/ public class wuziqi { public static void main(String args[]) { ChessFrame cf = new ChessFrame(); cf.setVisible(true); } }; /* *類ChessFrame主要功能是建立五子棋遊戲主窗體和選單 **/ class ChessFrame extends JFrame implements ActionListener { private static final long serialVersionUID = 2183726320279905885L; private String[] strmode={"人機對弈","人人對弈"}; private String[] strorder={"玩家先手","計算機先手"}; public static boolean iscomputer=true; public static boolean checkcomputer=true; public static boolean isorder=true; private int width=15,height=15; private ChessModel cm; private MainPanel mp; public static int qipan[][]=new int[15][15]; //構造五子棋遊戲的主窗體 public ChessFrame() { this.setTitle("五子棋遊戲"); cm=new ChessModel(1); mp=new MainPanel(cm); Container con=this.getContentPane(); con.add(mp,"Center"); this.setResizable(false); this.addWindowListener(new ChessWindowEvent()); MapSize(14,14); setLocation(400,100); JMenuBar mbar = new JMenuBar(); this.setJMenuBar(mbar); JMenu gameMenu = new JMenu("遊戲"); mbar.add(makeMenu(gameMenu, new Object[] { "開局","模式","先手順序","悔棋", null, "退出" }, this)); JMenu lookMenu =new JMenu("檢視"); mbar.add(makeMenu(lookMenu,new Object[] { "Metal","Motif","Windows" },this)); JMenu helpMenu = new JMenu("幫助"); mbar.add(makeMenu(helpMenu, new Object[] { "關於" }, this)); } //構造五子棋遊戲的主選單 public JMenu makeMenu(Object parent, Object items[], Object target) { JMenu m = null; if(parent instanceof JMenu) m = (JMenu)parent; else if(parent instanceof String) m = new JMenu((String)parent); else return null; for(int i = 0; i < items.length; i++) if(items[i] == null) m.addSeparator(); else if(items[i] == "模式") { JMenu jm = new JMenu("模式"); ButtonGroup group=new ButtonGroup(); JRadioButtonMenuItem rmenu; for(int h=0;h<strmode.length;h++) { rmenu=makeRadioButtonMenuItem(strmode[h],target); if(h==0) rmenu.setSelected(true); jm.add(rmenu); group.add(rmenu); } m.add(jm); } else if(items[i]=="先手順序") { JMenu jm = new JMenu("先手順序"); ButtonGroup group=new ButtonGroup(); JRadioButtonMenuItem rmenu; for(int k=0;k<strorder.length;k++) { rmenu=makeRadioButtonMenuItem(strorder[k],target); if(k==0) rmenu.setSelected(true); jm.add(rmenu); group.add(rmenu); } m.add(jm); } else m.add(makeMenuItem(items[i], target)); return m; } //構造五子棋遊戲的選單項 public JMenuItem makeMenuItem(Object item, Object target){ JMenuItem r = null; if(item instanceof String) r = new JMenuItem((String)item); else if(item instanceof JMenuItem) r = (JMenuItem)item; else return null; if(target instanceof ActionListener) r.addActionListener((ActionListener)target); return r; } //構造五子棋遊戲的單選按鈕式選單項 public JRadioButtonMenuItem makeRadioButtonMenuItem( Object item, Object target){ JRadioButtonMenuItem r = null; if(item instanceof String) r = new JRadioButtonMenuItem((String)item); else if(item instanceof JRadioButtonMenuItem) r = (JRadioButtonMenuItem)item; else return null; if(target instanceof ActionListener) r.addActionListener((ActionListener)target); return r; } public void MapSize(int w,int h){ setSize(w * 30+67 , h * 30+110); if(!ChessFrame.checkcomputer) { ChessFrame.iscomputer=false; } else { ChessFrame.iscomputer=true; } mp.setModel(cm); mp.repaint(); } public boolean getiscomputer(){ return ChessFrame.iscomputer; } public void restart(){ int modeChess = cm.getModeChess(); if(modeChess <= 3 && modeChess >= 1){ cm = new ChessModel(modeChess); MapSize(cm.getWidth(),cm.getHeight()); System.out.println("/u81EA/u5B9A/u4E49"); } } public void actionPerformed(ActionEvent e){ String arg=e.getActionCommand(); try{ if (arg.equals("Windows")) UIManager.setLookAndFeel( "com.sun.java.swing.plaf.windows.WindowsLookAndFeel"); else if(arg.equals("Motif")) UIManager.setLookAndFeel( "com.sun.java.swing.plaf.motif.MotifLookAndFeel"); else UIManager.setLookAndFeel( "javax.swing.plaf.metal.MetalLookAndFeel" ); SwingUtilities.updateComponentTreeUI(this); }catch(Exception ee){} if(arg.equals("人機對弈")){ ChessFrame.checkcomputer=true; ChessFrame.iscomputer=true; cm=new ChessModel(cm.getModeChess()); MapSize(cm.getWidth(),cm.getHeight()); SwingUtilities.updateComponentTreeUI(this); } if(arg.equals("人人對弈")){ ChessFrame.checkcomputer=false; ChessFrame.iscomputer=false; cm=new ChessModel(cm.getModeChess()); MapSize(cm.getWidth(),cm.getHeight()); SwingUtilities.updateComponentTreeUI(this); } if(arg.equals("計算機先手")) { ChessFrame.isorder=false; cm=new ChessModel(cm.getModeChess()); MapSize(cm.getWidth(),cm.getHeight()); SwingUtilities.updateComponentTreeUI(this); } if(arg.equals("玩家先手")) { ChessFrame.isorder=true; cm=new ChessModel(cm.getModeChess()); MapSize(cm.getWidth(),cm.getHeight()); SwingUtilities.updateComponentTreeUI(this); } if(arg.equals("開局")){ restart(); if(ChessFrame.isorder==false) cm.first(); } if(arg.equals("悔棋")){ int modeChess = cm.getModeChess(); if(modeChess <= 3 && modeChess >= 1){ cm = new ChessModel(modeChess); for(int i=0;i<this.width;i++) { for(int j=0;j<this.height;j++) { cm.arrMapShow[i][j] =qipan[i][j]; } } MapSize(cm.getWidth(),cm.getHeight()); } } if(arg.equals("關於")) JOptionPane.showMessageDialog(this, "五子棋遊戲測試版本——By 江西財經大學08計一張帥", "關於", 0); if(arg.equals("退出")) System.exit(0); } } /* *類ChessModel實現了整個五子棋程式演算法的核心 */ class ChessModel { //棋盤的寬度、高度、棋盤的模式（如20×15） private int width=15; private int modeChess; //棋盤方格的橫向、縱向座標 private int x=0,y=0; private int temp1; private int temp2; private int temp3; private int temp4; int[][] arrMapShow; //交換棋手的標識，棋盤方格上是否有棋子的識別符號,先手順序的標識 private boolean isOdd,isExist; private ChessFrame cf; //1表示黑棋 ，2表示白棋，-1表示空白可下處 public ChessModel() {} //該構造方法根據不同的棋盤模式（modeChess）來構建對應大小的棋盤 public ChessModel(int modeChess){ this.isOdd=true; if(modeChess == 1){ PanelInit(14, 14, modeChess); } } //按照棋盤模式構建棋盤大小 private void PanelInit(int width, int height, int modeChess){ this.width = width; this.modeChess = modeChess; arrMapShow = new int[width+1][height+1]; for(int i = 0; i <=width; i++){ for(int j = 0; j <=height; j++){ arrMapShow[i][j] = -1; } } } //獲取是否交換棋手的識別符號 public boolean getisOdd(){ return this.isOdd; } //設定交換棋手的識別符號 public void setisOdd(boolean isodd){ if(isodd) this.isOdd=true; else this.isOdd=false; } //獲取某棋盤方格是否有棋子的標識值 public boolean getisExist(){ return this.isExist; } //獲取棋盤寬度 public int getWidth(){ return this.width; } //獲取棋盤高度 public int getHeight(){ return this.width; } //獲取棋盤模式 public int getModeChess(){ return this.modeChess; } //獲取棋盤方格上棋子的資訊 public int[][] getarrMapShow(){ return arrMapShow; } //判斷下子的橫向、縱向座標是否越界 private boolean badxy(int x, int y){ if(x >= width+30 || x < 0) return true; return y >= width+30 || y < 0; } //計算棋盤上某一方格上八個方向棋子的最大值， //這八個方向分別是：左、右、上、下、左上、左下、右上、右下 public boolean chessExist(int i,int j){ if(this.arrMapShow[i][j]==1 || this.arrMapShow[i][j]==2) return true; return false; } //判斷該座標位置是否可下棋子 // public void readyplay(int x,int y){ // if(badxy(x,y)) // return; // if (chessExist(x,y)) // return; // this.arrMapShow[x][y]=3; // } //在該座標位置下棋子 public void play(int x,int y){ if(badxy(x,y)) return; if(chessExist(x,y)){ this.isExist=true; return; }else this.isExist=false; if(getisOdd()){ setisOdd(false); this.arrMapShow[x][y]=1; }else{ setisOdd(true); this.arrMapShow[x][y]=2; } } //計算機走棋 /* *說明：用窮舉法判斷每一個座標點的四個方向的的最大棋子數， *最後得出棋子數最大值的座標，下子 **/ void computerDo(int flag) { int max_black,max_white,count=0,max=0,max_temp,level,x[] ={-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2},y[]={-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2,-2},i,j; setisOdd(true); for(i = 0; i < width; i++) { for(j = 0; j < width; j++) { if(this.arrMapShow[i][j]==-1) {//演算法判斷是否下子 if(lian_si(i,j,2)||duan_lian_si(i,j,2)) { level=43; x[level]=i; y[level]=j; } else { if(lian_si(i,j,1)||duan_lian_si(i,j,1)) { level=42; x[level]=i; y[level]=j; } else { if(si_si(i,j,2)&&zhouwei3(i,j,2)||si_san(i,j,2)&&zhouwei3(i,j,2)) { level=41; x[level]=i; y[level]=j; } else { if(si_si(i,j,2)&&zhouwei2(i,j,2)||si_san(i,j,2)&&zhouwei2(i,j,2)) { level=40; x[level]=i; y[level]=j; } else { if(si_si(i,j,2)&&zhouwei1(i,j,2)||si_san(i,j,2)&&zhouwei1(i,j,2)) { level=39; x[level]=i; y[level]=j; } else { if(si_si(i,j,2)||si_san(i,j,2)) { level=38; x[level]=i; y[level]=j; } else { if(huo_lian_san(i,j,1)&&huo_lian_san(i,j,2)) { level=37; x[level]=i; y[level]=j; } else { if(huo_lian_san(i,j,2)&&huo_duan_er(i,j,2)||huo_lian_san(i,j,2)&&huo_er(i,j,2)) { level=36; x[level]=i; y[level]=j; } else { if(huo_lian_san(i,j,2)&&zhouwei3(i,j,2)||duan_lian_san(i,j,2)&&zhouwei3(i,j,2)) { level=35; x[level]=i; y[level]=j; } else { if(huo_lian_san(i,j,2)&&zhouwei2(i,j,2)||duan_lian_san(i,j,2)&&zhouwei2(i,j,2)) { level=34; x[level]=i; y[level]=j; } else { if(huo_lian_san(i,j,2)&&zhouwei1(i,j,2)||duan_lian_san(i,j,2)&&zhouwei1(i,j,2)) { level=33; x[level]=i; y[level]=j; } else { if(huo_lian_san(i,j,2)||duan_lian_san(i,j,2)) { level=32; x[level]=i; y[level]=j; } else { if(si_si(i,j,1)&&zhouwei3(i,j,1)||si_san(i,j,1)&&zhouwei3(i,j,1)) { level=31; x[level]=i; y[level]=j; } else { if(si_si(i,j,1)&&zhouwei2(i,j,1)||si_san(i,j,1)&&zhouwei2(i,j,1)) { level=30; x[level]=i; y[level]=j; } else { if(si_si(i,j,1)&&zhouwei1(i,j,1)||si_san(i,j,1)&&zhouwei1(i,j,1)) { level=29; x[level]=i; y[level]=j; } else { if(si_si(i,j,1)||si_san(i,j,1)) { level=28; x[level]=i; y[level]=j; } else { if(huo_lian_san(i,j,1)&&huo_er(i,j,2)||huo_lian_san(i,j,1)&&huo_duan_er(i,j,2)) { level=27; x[level]=i; y[level]=j; } else { if(huo_lian_san(i,j,1)&&zhouwei3(i,j,1)||duan_lian_san(i,j,1)&&zhouwei3(i,j,1)) { level=26; x[level]=i; y[level]=j; } else { if(huo_lian_san(i,j,1)&&zhouwei2(i,j,1)||duan_lian_san(i,j,1)&&zhouwei2(i,j,1)) { level=25; x[level]=i; y[level]=j; } else { if(huo_lian_san(i,j,1)&&zhouwei1(i,j,1)||duan_lian_san(i,j,1)&&zhouwei1(i,j,1)) { level=24; x[level]=i; y[level]=j; } else { if(huo_lian_san(i,j,1)||duan_lian_san(i,j,1)) { level=23; x[level]=i; y[level]=j; } else { if(lian_duan_si(i,j,2)&&huo_er(i,j,2)||lian_duan_si(i,j,2)&&huo_lian_san(i,j,2)||lian_duan_si(i,j,2)&&huo_duan_er(i,j,2)||si_lian_san(i,j,2)&&huo_er(i,j,2)||si_lian_san(i,j,2)&&huo_lian_san(i,j,2)||si_lian_san(i,j,2)&&huo_duan_er(i,j,2)) { level=22; x[level]=i; y[level]=j; } else { if(san_san(i,j,2)) { level=21; x[level]=i; y[level]=j; } else { if((huo_er(i,j,2)&&san_san(i,j,1))||(huo_duan_er(i,j,2)&&san_san(i,j,1))) { level=20; x[level]=i; y[level]=j; } else { if(san_san(i,j,1)) { level=19; x[level]=i; y[level]=j; } else { if(lian_duan_si(i,j,1)&&huo_er(i,j,1)||lian_duan_si(i,j,1)&&huo_lian_san(i,j,1)||lian_duan_si(i,j,1)&&huo_duan_er(i,j,1)||si_lian_san(i,j,1)&&huo_er(i,j,1)||si_lian_san(i,j,1)&&huo_lian_san(i,j,1)||si_lian_san(i,j,1)&&huo_duan_er(i,j,1)) { level=18; x[level]=i; y[level]=j; } else { if(si_lian_san(i,j,2)||lian_duan_si(i,j,2)) { level=17; x[level]=i; y[level]=j; } else { if(huo_er(i,j,2)&&shi_zi_er(i,j,2)) { level=16; x[level]=i; y[level]=j; } else { if((huo_er(i,j,2)&&huo_er(i,j,1))||(huo_duan_er(i,j,2)&&huo_er(i,j,1))||(huo_duan_er(i,j,2)&&huo_duan_er(i,j,1))||(huo_er(i,j,2)&&huo_duan_er(i,j,1))) { level=15; x[level]=i; y[level]=j; } else { if((huo_er(i,j,2)&&si_er(i,j,2))||(huo_er(i,j,2)&&si_er(i,j,1))) { level=14; x[level]=i; y[level]=j; } else { if(huo_er(i,j,2)||huo_duan_er(i,j,2)) { level=13; x[level]=i; y[level]=j; } else { if(huo_er(i,j,2)&&zhouwei3(i,j,2)||huo_duan_er(i,j,2)&&zhouwei3(i,j,2)) { level=12; x[level]=i; y[level]=j; } else { if(huo_er(i,j,2)&&zhouwei2(i,j,2)||huo_duan_er(i,j,2)&&zhouwei2(i,j,2)) { level=11; x[level]=i; y[level]=j; } else { if(huo_er(i,j,2)&&zhouwei1(i,j,2)||huo_duan_er(i,j,2)&&zhouwei1(i,j,2)) { level=10; x[level]=i; y[level]=j; } else { if(huo_er(i,j,1)&&shi_zi_er(i,j,1)) { level=9; x[level]=i; y[level]=j; } else { if(huo_er(i,j,1)&&zhouwei3(i,j,1)||huo_duan_er(i,j,1)&&zhouwei3(i,j,1)) { level=8; x[level]=i; y[level]=j; } else { if(huo_er(i,j,1)&&zhouwei2(i,j,1)||huo_duan_er(i,j,1)&&zhouwei2(i,j,1)) { level=7; x[level]=i; y[level]=j; } else { if(huo_er(i,j,1)&&zhouwei1(i,j,1)||huo_duan_er(i,j,1)&&zhouwei1(i,j,1)) { level=6; x[level]=i; y[level]=j; } else { if(huo_er(i,j,1)||huo_duan_er(i,j,1)) { level=5; x[level]=i; y[level]=j; } else { if(xie_zi_er(i,j,2)||shi_zi_er(i,j,2)) { level=4; x[level]=i; y[level]=j; } else { if(xie_zi_er(i,j,1)||shi_zi_er(i,j,1)) { level=3; x[level]=i; y[level]=j; } else { if(si_er(i,j,2)) { level=2; x[level]=i; y[level]=j; } else { max_white=checkMax(i,j,2);//判斷白子的最大值 max_black=checkMax(i,j,1);//判斷黑子的最大值 if(max_white>max_black) max_temp=max_white; else max_temp=max_black; if(max_temp>max&&count==0) { max=max_temp; count++; level=1; x[level]=i; y[level]=j; } else if(count==1) { for(int m=0;m<width-1;m++) for(int n=0;n<width-1;n++) if(arrMapShow[m][n]==2) { level=1; if(m<this.width-1&&m>=1&&n>=1&&n<this.width-1) { if(arrMapShow[m+1][n-1]==-1) { x[level]=m+1; y[level]=n-1; } else if(arrMapShow[m-1][n+1]==-1) { x[level]=m-1; y[level]=n+1; } } } count=0; } } } } } } } } } } } } } } } } } } } } } } } } } } } } } } } } } } } } } } } } } } } } } } if(flag==4) { for(i=43;i>=1;i--) { if(x[i]!=-2) { temp4=i; break; } } } if(flag==3) { for(i=43;i>=1;i--) { if(x[i]!=-2) { this.arrMapShow[x[i]][y[i]]=1; computerDo(flag+1); this.arrMapShow[x[i]][y[i]]=-1; temp3=i; break; } } } if(flag==2) { for(i=43;i>=1;i--) { if(x[i]!=-2) { this.arrMapShow[x[i]][y[i]]=2; computerDo(flag+1); this.arrMapShow[x[i]][y[i]]=-1; temp2=i; break; } } } else if(flag==1) { for(i=43;i>=1;i--) { if(x[i]!=-2) { this.arrMapShow[x[i]][y[i]]=1; computerDo(flag+1); this.arrMapShow[x[i]][y[i]]=-1; temp1=i; break; } } } else if(flag==0) { for(i=43;i>=1;i--) { if(x[i]!=-2) { this.arrMapShow[x[i]][y[i]]=2; computerDo(flag+1); this.arrMapShow[x[i]][y[i]]=-1; if(i>=19&&(temp4!=19&&temp4!=20&&temp4!=31&&temp4!=23&&temp4!=24&&temp4!=25&&temp4!=26&&temp4!=27&&temp4!=28&&temp4!=29&&temp4!=30&&temp4!=42)||temp4>=19) { this.x=x[i]; this.y=y[i]; this.arrMapShow[this.x][this.y]=2; setX(this.x); setY(this.y); if(judgeSuccess(this.x,this.y,true)==true) { JPanel jp=new JPanel(); showDefeat(jp); cf.restart(); } return ; } if(i>=19&&(temp3!=20&&temp3!=19&&temp3!=31&&temp3!=23&&temp3!=24&&temp3!=25&&temp3!=26&&temp3!=27&&temp3!=28&&temp3!=29&&temp3!=30&&temp3!=37&&temp3!=42)||(temp3>=19&&(temp3!=20&&temp3!=19&&temp3!=31&&temp3!=23&&temp3!=24&&temp3!=25&&temp3!=26&&temp3!=27&&temp3!=28&&temp3!=29&&temp3!=30&&temp3!=37&&temp3!=42))) { this.x=x[i]; this.y=y[i]; this.arrMapShow[this.x][this.y]=2; setX(this.x); setY(this.y); if(judgeSuccess(this.x,this.y,true)==true) { JPanel jp=new JPanel(); showDefeat(jp); cf.restart(); } return ; } if(i>=19&&(temp2!=20&&temp2!=19&&temp2!=31&&temp2!=23&&temp2!=24&&temp2!=25&&temp2!=26&&temp2!=27&&temp2!=28&&temp2!=29&&temp2!=30&&temp2!=42)||temp2>=19) { this.x=x[i]; this.y=y[i]; this.arrMapShow[this.x][this.y]=2; setX(this.x); setY(this.y); if(judgeSuccess(this.x,this.y,true)==true) { JPanel jp=new JPanel(); showDefeat(jp); cf.restart(); } return ; } if(i>=19&&(temp1!=20&&temp1!=19&&temp1!=31&&temp1!=23&&temp1!=24&&temp1!=25&&temp1!=26&&temp1!=27&&temp1!=28&&temp1!=29&&temp1!=30&&temp1!=37&&temp1!=42)||(temp1>=19&&(temp1!=20&&temp1!=19&&temp1!=31&&temp1!=23&&temp1!=24&&temp1!=25&&temp1!=26&&temp1!=27&&temp1!=28&&temp1!=29&&temp1!=30&&temp1!=37&&temp1!=42))) { this.x=x[i]; this.y=y[i]; this.arrMapShow[this.x][this.y]=2; setX(this.x); setY(this.y); if(judgeSuccess(this.x,this.y,true)==true) { JPanel jp=new JPanel(); showDefeat(jp); cf.restart(); } return ; } } } for(i=43;i>=1;i--) { if(x[i]!=-2) { this.x=x[i]; this.y=y[i]; break; } } this.arrMapShow[this.x][this.y]=2; setX(this.x); setY(this.y); if(judgeSuccess(this.x,this.y,true)==true) { JPanel jp=new JPanel(); showDefeat(jp); cf.restart(); } } } public void first() { int height,width; width=getWidth(); height=getHeight(); setX(width/2); setY(height/2); this.arrMapShow[width/2][height/2]=2; } //記錄電腦下子後的橫向座標 public void setX(int x){ this.x=x; } //記錄電腦下子後的縱向座標 public void setY(int y){ this.y=y; } //獲取電腦下子的橫向座標 public int getX(){ return this.x; } //獲取電腦下子的縱向座標 public int getY(){ return this.y; } //計算棋盤上某一方格上八個方向棋子的最大值， //這八個方向分別是：左、右、上、下、左上、左下、右上、右下 int checkMax(int x, int y,int black_or_white) { int num=0,max_num,max_temp=0,i; int x_temp=x,y_temp=y; int x_temp1=x_temp,y_temp1=y_temp; //judge right for(i=1;i<5;i++){ x_temp1+=1; if(x_temp1>=width) break; if(arrMapShow[x_temp1][y_temp1]==black_or_white) num++; else break; } //judge left x_temp1=x_temp; for(i=1;i<5;i++){ x_temp1-=1; if(x_temp1<0) break; if(arrMapShow[x_temp1][y_temp1]==black_or_white) num++; else break; } if(num<5) max_temp=num; //judge up x_temp1=x_temp; y_temp1=y_temp; num=0; for(i=1;i<5;i++){ y_temp1-=1; if(y_temp1<0) break; if(arrMapShow[x_temp1][y_temp1]==black_or_white) num++; else break; } //judge down y_temp1=y_temp; for(i=1;i<5;i++){ y_temp1+=1; if(y_temp1>=width) break; if(arrMapShow[x_temp1][y_temp1]==black_or_white) num++; else break; } if(num>max_temp&&num<5) max_temp=num; //judge left_up x_temp1=x_temp; y_temp1=y_temp; num=0; for(i=1;i<5;i++){ x_temp1-=1; y_temp1-=1; if(y_temp1<0 || x_temp1<0) break; if(arrMapShow[x_temp1][y_temp1]==black_or_white) num++; else break; } //judge right_down x_temp1=x_temp; y_temp1=y_temp; for(i=1;i<5;i++){ x_temp1+=1; y_temp1+=1; if(y_temp1>=width || x_temp1>=width) break; if(arrMapShow[x_temp1][y_temp1]==black_or_white) num++; else break; } if(num>max_temp&&num<5) max_temp=num; //judge right_up x_temp1=x_temp; y_temp1=y_temp; num=0; for(i=1;i<5;i++){ x_temp1+=1; y_temp1-=1; if(y_temp1<0 || x_temp1>=width) break; if(arrMapShow[x_temp1][y_temp1]==black_or_white) num++; else break; } //judge left_down x_temp1=x_temp; y_temp1=y_temp; for(i=1;i<5;i++){ x_temp1-=1; y_temp1+=1; if(y_temp1>=width || x_temp1<0) break; if(arrMapShow[x_temp1][y_temp1]==black_or_white) num++; else break; } if(num>max_temp&&num<5) max_temp=num; max_num=max_temp; return max_num; } //判斷 三三型別 boolean san_san(int x,int y,int black_or_white) { int flag1=0,flag2=0,flag3=0,flag4=0,flag5=0,flag6=0,flag7=0,flag8=0,flag9=0,flag10=0,flag11=0,flag12=0; int x_temp=x,y_temp=y; int x_temp1=x_temp,y_temp1=y_temp; //judge up if(x_temp1>=4) { if(arrMapShow[x_temp1-1][y_temp1]==black_or_white&&arrMapShow[x_temp1-2][y_temp1]==-1&&arrMapShow[x_temp1-3][y_temp1]==black_or_white&&arrMapShow[x_temp1-4][y_temp1]==-1) flag1=1; else if(arrMapShow[x_temp1-1][y_temp1]==-1&&arrMapShow[x_temp1-2][y_temp1]==black_or_white&&arrMapShow[x_temp1-3][y_temp1]==black_or_white&&arrMapShow[x_temp1-4][y_temp1]==-1) flag1=1; else if(arrMapShow[x_temp1-1][y_temp1]==black_or_white&&arrMapShow[x_temp1-2][y_temp1]==black_or_white&&arrMapShow[x_temp1-3][y_temp1]==-1) flag1=1; } if(x_temp1>=4&&x_temp1<=width-1) if(arrMapShow[x_temp1+1][y_temp1]==-1&&arrMapShow[x_temp1-1][y_temp1]==black_or_white&&arrMapShow[x_temp1-2][y_temp1]==black_or_white&&arrMapShow[x_temp1-3][y_temp1]==-1) flag1=1; //judge down x_temp1=x_temp; if(x_temp1<width-4) { if(arrMapShow[x_temp1+1][y_temp1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1]==-1&&arrMapShow[x_temp1+3][y_temp1]==black_or_white&&arrMapShow[x_temp1+4][y_temp1]==-1) flag2=1; else if(arrMapShow[x_temp1+1][y_temp1]==-1&&arrMapShow[x_temp1+2][y_temp1]==black_or_white&&arrMapShow[x_temp1+3][y_temp1]==black_or_white&&arrMapShow[x_temp1+4][y_temp1]==-1) flag2=1; else if(arrMapShow[x_temp1+1][y_temp1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1]==black_or_white&&arrMapShow[x_temp1+3][y_temp1]==-1) flag2=1; } if(x_temp1>=1&&x_temp1<width-4) if(arrMapShow[x_temp1-1][y_temp1]==-1&&arrMapShow[x_temp1+1][y_temp1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1]==black_or_white&&arrMapShow[x_temp1+3][y_temp1]==-1) flag2=1; if(x_temp1>=2&&x_temp1<width-2) { if(arrMapShow[x_temp1-1][y_temp1]==black_or_white&&arrMapShow[x_temp1-2][y_temp1]==-1&&arrMapShow[x_temp1+1][y_temp1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1]==-1) flag9=1; else if(arrMapShow[x_temp1-1][y_temp1]==black_or_white&&arrMapShow[x_temp1-2][y_temp1]==-1&&arrMapShow[x_temp1+1][y_temp1]==-1&&arrMapShow[x_temp1+2][y_temp1]==black_or_white) flag9=1; else if(arrMapShow[x_temp1-1][y_temp1]==-1&&arrMapShow[x_temp1-2][y_temp1]==black_or_white&&arrMapShow[x_temp1+1][y_temp1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1]==-1) flag9=1; } //judge left x_temp1=x_temp; if(y_temp1>=4) { if(arrMapShow[x_temp1][y_temp1-1]==black_or_white&&arrMapShow[x_temp1][y_temp1-2]==-1&&arrMapShow[x_temp1][y_temp1-3]==black_or_white&&arrMapShow[x_temp1][y_temp1-4]==-1) flag3=1; else if(arrMapShow[x_temp1][y_temp1-1]==-1&&arrMapShow[x_temp1][y_temp1-2]==black_or_white&&arrMapShow[x_temp1][y_temp1-3]==black_or_white&&arrMapShow[x_temp1][y_temp1-4]==-1) flag3=1; else if(arrMapShow[x_temp1][y_temp1-1]==black_or_white&&arrMapShow[x_temp1][y_temp1-2]==black_or_white&&arrMapShow[x_temp1][y_temp1-3]==-1) flag3=1; } if(y_temp1>=4&&y_temp1<width-1) if(arrMapShow[x_temp1][y_temp1+1]==-1&&arrMapShow[x_temp1][y_temp1-1]==black_or_white&&arrMapShow[x_temp1][y_temp1-2]==black_or_white&&arrMapShow[x_temp1][y_temp1-3]==-1) flag3=1; //judge right y_temp1=y_temp; if(y_temp1<width-4) { if(arrMapShow[x_temp1][y_temp1+1]==black_or_white&&arrMapShow[x_temp1][y_temp1+2]==-1&&arrMapShow[x_temp1][y_temp1+3]==black_or_white&&arrMapShow[x_temp1][y_temp1+4]==-1) flag4=1; else if(arrMapShow[x_temp1][y_temp1+1]==-1&&arrMapShow[x_temp1][y_temp1+2]==black_or_white&&arrMapShow[x_temp1][y_temp1+3]==black_or_white&&arrMapShow[x_temp1][y_temp1+4]==-1) flag4=1; else if(arrMapShow[x_temp1][y_temp1+1]==black_or_white&&arrMapShow[x_temp1][y_temp1+2]==black_or_white&&arrMapShow[x_temp1][y_temp1+3]==-1) flag4=1; } if(y_temp1>=1&&y_temp1<width-4) if(arrMapShow[x_temp1][y_temp1-1]==-1&&arrMapShow[x_temp1][y_temp1+1]==black_or_white&&arrMapShow[x_temp1][y_temp1+2]==black_or_white&&arrMapShow[x_temp1][y_temp1+3]==-1) flag4=1; if(y_temp1>=2&&y_temp1<width-2) { if(arrMapShow[x_temp1][y_temp1-1]==black_or_white&&arrMapShow[x_temp1][y_temp1-2]==-1&&arrMapShow[x_temp1][y_temp1+1]==black_or_white&&arrMapShow[x_temp1][y_temp1+2]==-1) flag10=1; else if(arrMapShow[x_temp1][y_temp1-1]==black_or_white&&arrMapShow[x_temp1][y_temp1-2]==-1&&arrMapShow[x_temp1][y_temp1+1]==-1&&arrMapShow[x_temp1][y_temp1+2]==black_or_white) flag10=1; else if(arrMapShow[x_temp1][y_temp1-1]==-1&&arrMapShow[x_temp1][y_temp1-2]==black_or_white&&arrMapShow[x_temp1][y_temp1+1]==black_or_white&&arrMapShow[x_temp1][y_temp1+2]==-1) flag10=1; } //judge left_up x_temp1=x_temp; y_temp1=y_temp; if(y_temp1>=4&&x_temp1>=4) { if(arrMapShow[x_temp1-1][y_temp1-1]==black_or_white&&arrMapShow[x_temp1-2][y_temp1-2]==-1&&arrMapShow[x_temp1-3][y_temp1-3]==black_or_white&&arrMapShow[x_temp1-4][y_temp1-4]==-1) flag5=1; else if(arrMapShow[x_temp1-1][y_temp1-1]==-1&&arrMapShow[x_temp1-2][y_temp1-2]==black_or_white&&arrMapShow[x_temp1-3][y_temp1-3]==black_or_white&&arrMapShow[x_temp1-4][y_temp1-4]==-1) flag5=1; else if(arrMapShow[x_temp1-1][y_temp1-1]==black_or_white&&arrMapShow[x_temp1-2][y_temp1-2]==black_or_white&&arrMapShow[x_temp1-3][y_temp1-3]==-1) flag5=1; } if(y_temp1>=4&&x_temp1>=4&&y_temp1<width-1&&x_temp1<width-1) if(arrMapShow[x_temp1+1][y_temp1+1]==-1&&arrMapShow[x_temp1-1][y_temp1-1]==black_or_white&&arrMapShow[x_temp1-2][y_temp1-2]==black_or_white&&arrMapShow[x_temp1-3][y_temp1-3]==-1) flag5=1; //judge right_down if(y_temp1<width-4&&x_temp1<width-4) { if(arrMapShow[x_temp1+1][y_temp1+1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1+2]==-1&&arrMapShow[x_temp1+3][y_temp1+3]==black_or_white&&arrMapShow[x_temp1+4][y_temp1+4]==-1) flag6=1; else if(arrMapShow[x_temp1+1][y_temp1+1]==-1&&arrMapShow[x_temp1+2][y_temp1+2]==black_or_white&&arrMapShow[x_temp1+3][y_temp1+3]==black_or_white&&arrMapShow[x_temp1+4][y_temp1+4]==-1) flag6=1; else if(arrMapShow[x_temp1+1][y_temp1+1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1+2]==black_or_white&&arrMapShow[x_temp1+3][y_temp1+3]==-1) flag6=1; } if(y_temp1>=1&&x_temp1>=1&&y_temp1<width-4&&x_temp1<width-4) if(arrMapShow[x_temp1-1][y_temp1-1]==-1&&arrMapShow[x_temp1+1][y_temp1+1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1+2]==black_or_white&&arrMapShow[x_temp1+3][y_temp1+3]==-1) flag6=1; if(y_temp1>=2&&y_temp1<width-2&&x_temp1>=2&&x_temp1<width-2) { if(arrMapShow[x_temp1-1][y_temp1-1]==black_or_white&&arrMapShow[x_temp1-2][y_temp1-2]==-1&&arrMapShow[x_temp1+1][y_temp1+1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1+2]==-1) flag11=1; else if(arrMapShow[x_temp1-1][y_temp1-1]==black_or_white&&arrMapShow[x_temp1-2][y_temp1-2]==-1&&arrMapShow[x_temp1+1][y_temp1+1]==-1&&arrMapShow[x_temp1+2][y_temp1+2]==black_or_white) flag11=1; else if(arrMapShow[x_temp1-1][y_temp1-1]==-1&&arrMapShow[x_temp1-2][y_temp1-2]==black_or_white&&arrMapShow[x_temp1+1][y_temp1+1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1+2]==-1) flag11=1; } //judge left_down x_temp1=x_temp; y_temp1=y_temp; if(y_temp1>=4&&x_temp1<width-4) { if(arrMapShow[x_temp1+1][y_temp1-1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1-2]==-1&&arrMapShow[x_temp1+3][y_temp1-3]==black_or_white&&arrMapShow[x_temp1+4][y_temp1-4]==-1) flag7=1; else if(arrMapShow[x_temp1+1][y_temp1-1]==-1&&arrMapShow[x_temp1+2][y_temp1-2]==black_or_white&&arrMapShow[x_temp1+3][y_temp1-3]==black_or_white&&arrMapShow[x_temp1+4][y_temp1-4]==-1) flag7=1; else if(arrMapShow[x_temp1+1][y_temp1-1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1-2]==black_or_white&&arrMapShow[x_temp1+3][y_temp1-3]==-1) flag7=1; } if(y_temp1>=4&&x_temp1>=1&&y_temp1<width-1&&x_temp1<width-4) if(arrMapShow[x_temp1-1][y_temp1+1]==-1&&arrMapShow[x_temp1+1][y_temp1-1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1-2]==black_or_white&&arrMapShow[x_temp1+3][y_temp1-3]==-1) flag7=1; //judge right_up x_temp1=x_temp; y_temp1=y_temp; if(y_temp1<width-4&&x_temp1>=4) { if(arrMapShow[x_temp1-1][y_temp1+1]==black_or_white&&arrMapShow[x_temp1-2][y_temp1+2]==-1&&arrMapShow[x_temp1-3][y_temp1+3]==black_or_white&&arrMapShow[x_temp1-4][y_temp1+4]==-1) flag8=1; else if(arrMapShow[x_temp1-1][y_temp1+1]==-1&&arrMapShow[x_temp1-2][y_temp1+2]==black_or_white&&arrMapShow[x_temp1-3][y_temp1+3]==black_or_white&&arrMapShow[x_temp1-4][y_temp1+4]==-1) flag8=1; else if(arrMapShow[x_temp1-1][y_temp1+1]==black_or_white&&arrMapShow[x_temp1-2][y_temp1+2]==black_or_white&&arrMapShow[x_temp1-3][y_temp1+3]==-1) flag8=1; } if(y_temp1>=1&&x_temp1>=4&&y_temp1<width-4&&x_temp1<width-1) if(arrMapShow[x_temp1+1][y_temp1-1]==-1&&arrMapShow[x_temp1-1][y_temp1+1]==black_or_white&&arrMapShow[x_temp1-2][y_temp1+2]==black_or_white&&arrMapShow[x_temp1-3][y_temp1+3]==-1) flag8=1; if(y_temp1>=2&&y_temp1<width-2&&x_temp1>=2&&x_temp1<width-2) { if(arrMapShow[x_temp1+1][y_temp1-1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1-2]==-1&&arrMapShow[x_temp1-1][y_temp1+1]==black_or_white&&arrMapShow[x_temp1-2][y_temp1+2]==-1) flag12=1; else if(arrMapShow[x_temp1+1][y_temp1-1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1-2]==-1&&arrMapShow[x_temp1-1][y_temp1+1]==-1&&arrMapShow[x_temp1-2][y_temp1+2]==black_or_white) flag12=1; else if(arrMapShow[x_temp1+1][y_temp1-1]==-1&&arrMapShow[x_temp1+2][y_temp1-2]==black_or_white&&arrMapShow[x_temp1-1][y_temp1+1]==black_or_white&&arrMapShow[x_temp1-2][y_temp1+2]==-1) flag12=1; } if(flag1+flag2+flag3+flag4+flag5+flag6+flag7+flag8+flag9+flag10+flag11+flag12>=2) { return true; } return false; } //判斷四三型別 boolean si_san(int x,int y,int black_or_white) { int flag1=0,flag2=0,flag3=0,flag4=0,flag5=0,flag6=0,flag7=0,flag8=0; int x_temp=x,y_temp=y; int x_temp1=x_temp,y_temp1=y_temp; //judge right_left_san if(x_temp1<width-4) { if(arrMapShow[x_temp1+1][y_temp1]==-1&&arrMapShow[x_temp1+2][y_temp1]==black_or_white&&arrMapShow[x_temp1+3][y_temp1]==black_or_white&&arrMapShow[x_temp1+4][y_temp1]==-1) flag1=1; else if(arrMapShow[x_temp1+1][y_temp1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1]==black_or_white&&arrMapShow[x_temp1+3][y_temp1]==-1&&arrMapShow[x_temp1+4][y_temp1]==-1) flag1=1; else if(arrMapShow[x_temp1+1][y_temp1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1]==-1&&arrMapShow[x_temp1+3][y_temp1]==black_or_white&&arrMapShow[x_temp1+4][y_temp1]==-1) flag1=1; } if(x_temp1>=4) { if(arrMapShow[x_temp1-1][y_temp1]==-1&&arrMapShow[x_temp1-2][y_temp1]==black_or_white&&arrMapShow[x_temp1-3][y_temp1]==black_or_white&&arrMapShow[x_temp1-4][y_temp1]==-1) flag1=1; else if(arrMapShow[x_temp1-1][y_temp1]==black_or_white&&arrMapShow[x_temp1-2][y_temp1]==black_or_white&&arrMapShow[x_temp1-3][y_temp1]==-1&&arrMapShow[x_temp1-4][y_temp1]==-1) flag1=1; else if(arrMapShow[x_temp1-1][y_temp1]==black_or_white&&arrMapShow[x_temp1-2][y_temp1]==-1&&arrMapShow[x_temp1-3][y_temp1]==black_or_white&&arrMapShow[x_temp1-4][y_temp1]==-1) flag1=1; } if(x_temp1>=2&&x_temp1<width-2) { if(arrMapShow[x_temp1-1][y_temp1]==black_or_white&&arrMapShow[x_temp1-2][y_temp1]==-1&&arrMapShow[x_temp1+1][y_temp1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1]==-1) flag1=1; else if(arrMapShow[x_temp1-1][y_temp1]==black_or_white&&arrMapShow[x_temp1+1][y_temp1]==-1&&arrMapShow[x_temp1+2][y_temp1]==black_or_white) flag1=1; else if(arrMapShow[x_temp1+1][y_temp1]==black_or_white&&arrMapShow[x_temp1-1][y_temp1]==-1&&arrMapShow[x_temp1-2][y_temp1]==black_or_white) flag1=1; } // judge right_left_si if(x_temp1<width-5) { if(arrMapShow[x_temp1+1][y_temp1]==-1&&arrMapShow[x_temp1+2][y_temp1]==black_or_white&&arrMapShow[x_temp1+3][y_temp1]==black_or_white&&arrMapShow[x_temp1+4][y_temp1]==black_or_white&&arrMapShow[x_temp1+5][y_temp1]==3-black_or_white) flag2=1; else if(arrMapShow[x_temp1+1][y_temp1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1]==-1&&arrMapShow[x_temp1+3][y_temp1]==black_or_white&&arrMapShow[x_temp1+4][y_temp1]==black_or_white&&arrMapShow[x_temp1+5][y_temp1]==3-black_or_white) flag2=1; } if(x_temp1<width-4&&x_temp1>=1) { if(arrMapShow[x_temp1-1][y_temp1]==-1&&arrMapShow[x_temp1+1][y_temp1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1]==black_or_white&&arrMapShow[x_temp1+3][y_temp1]==black_or_white&&arrMapShow[x_temp1+4][y_temp1]==3-black_or_white) flag2=1; else if(arrMapShow[x_temp1-1][y_temp1]==black_or_white&&arrMapShow[x_temp1+1][y_temp1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1]==-1&&arrMapShow[x_temp1+3][y_temp1]==black_or_white&&arrMapShow[x_temp1+4][y_temp1]==3-black_or_white) flag2=1; else if(arrMapShow[x_temp1-1][y_temp1]==black_or_white&&arrMapShow[x_temp1+1][y_temp1]==-1&&arrMapShow[x_temp1+2][y_temp1]==black_or_white&&arrMapShow[x_temp1+3][y_temp1]==black_or_white&&arrMapShow[x_temp1+4][y_temp1]==3-black_or_white) flag2=1; } if(x_temp1<width-3&&x_temp1>=2) { if(arrMapShow[x_temp1-1][y_temp1]==-1&&arrMapShow[x_temp1-2][y_temp1]==black_or_white&&arrMapShow[x_temp1+1][y_temp1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1]==black_or_white&&arrMapShow[x_temp1+3][y_temp1]==3-black_or_white) flag2=1; else if(arrMapShow[x_temp1-1][y_temp1]==black_or_white&&arrMapShow[x_temp1-2][y_temp1]==-1&&arrMapShow[x_temp1+1][y_temp1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1]==black_or_white&&arrMapShow[x_temp1+3][y_temp1]==3-black_or_white) flag2=1; else if(arrMapShow[x_temp1-1][y_temp1]==black_or_white&&arrMapShow[x_temp1-2][y_temp1]==black_or_white&&arrMapShow[x_temp1+1][y_temp1]==-1&&arrMapShow[x_temp1+2][y_temp1]==black_or_white&&arrMapShow[x_temp1+3][y_temp1]==3-black_or_white) flag2=1; } if(x_temp1<width-2&&x_temp1>=3) { if(arrMapShow[x_temp1-1][y_temp1]==black_or_white&&arrMapShow[x_temp1-2][y_temp1]==-1&&arrMapShow[x_temp1-3][y_temp1]==black_or_white&&arrMapShow[x_temp1+1][y_temp1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1]==3-black_or_white) flag2=1; else if(arrMapShow[x_temp1-1][y_temp1]==-1&&arrMapShow[x_temp1-2][y_temp1]==black_or_white&&arrMapShow[x_temp1-3][y_temp1]==black_or_white&&arrMapShow[x_temp1+1][y_temp1]==black_or_white&&arrMapShow[x_temp1+2][y_temp1]==3-black_or_white) flag2=1; } if(x_temp1>=5) { if(arrMapShow[x_temp1-1][y_temp1]==-1&&arrMapShow[x_temp1-2][y_temp1]==black_or_white&&arrMapShow[x_temp1-3][y_temp1]==black_or_white&&arrMapShow[x_temp1-4][y_temp1]==black_or_white&&arrMapShow[x_temp1-1][y_temp1]==3-black_or_white) flag2=1; else if(arrMapShow[x_temp1-1][y_temp1]==black_or_white&&arrMapShow[x_temp1-2][y_temp1]==-1&&arrMapShow[x_temp1-3][y_temp1]==black_or_white&&arrMapShow[x_temp1-4][y_temp1]==black_or_white&&arrMapShow[x_temp1-1][y_temp1]==3-black_or_white) flag2=1; } if(x_temp1>=4&&x_temp1<width-1) { if(arrMapShow[x_temp1+1][y_temp1]==-1&&arrMapShow[x_temp1-1][y_temp1]==black_or_white&&arrMapShow[x_temp1-2][y_temp1]==black_or_white&&ar </div> <div class="entry-footer"> <div class="entry-tag"> </div> <div class="entry-page"> <center><script type="text/javascript" src="/js/article.js"></script></center> </div> <h3 class="entry-related-title">相關推薦</h3> <style> .r{ margin-bottom:10px; border-bottom:1px solid #f1f1f1; padding-bottom:10px;} .r p{ color:#999; line-height:25px;} .r h5 a{ font-size:16px; line-height:25px;} .r h5 a:hover{ color:#ff6600} </style> <div class="r"> <h5><a href="/content/1547945125.html" target="_blank"><font color=red>五子棋</font><font color=red>人機</font><font color=red>對弈</font><font color=red>程式碼</font>——<font color=red>java</font><font color=red>版</font></a></h5> <p> 演算法是窮舉遞迴法，只不過用java重新寫了一遍 import java.awt.Color; import java.awt.Container; import java.awt.Graphics; import java.awt.event.ActionEvent </p> </div> <div class="r"> <h5><a href="/content/1547544784.html" target="_blank"><font color=red>五子棋</font>(<font color=red>人機</font><font color=red>對弈</font>)——<font color=red>Java</font>權值法<font color=red>五子棋</font>博弈</a></h5> <p> 五子棋人機博弈 五子棋，人與人之間博弈，我們不用考慮太多，都是玩家自動思考。 但是如果我們要玩一個單機的五子棋，實現人機的對戰，那麼我就得“幫”電腦考慮下走哪步了。 實現的方法大概有三種： 最大權值法 決策樹法 機器學習訓練 這裡我們主要針對第 </p> </div> <div class="r"> <h5><a href="/content/1546478824.html" target="_blank">給愛人的玫瑰花表白程式<font color=red>程式碼</font>--<font color=red>Java</font><font color=red>版</font></a></h5> <p> 1 書寫表白語句的frame（漸入功能） package com.wanju.blessing; import java.awt.Color; import java.awt.Container; import java.awt.Dimension; import jav </p> </div> <div class="r"> <h5><a href="/content/1601186415.html" target="_blank">正則表示式（<font color=red>程式碼</font><font color=red>java</font><font color=red>版</font>）</a></h5> <p> [toc] >重新發佈於2020年09月27日，寫於2016年 看了好些天的正則表示式，終於有時間來寫一篇關於它的部落格了。也是因為前段時間做標籤處理的工作用到，用正則匹配標籤規則，少寫了不少程式碼。在有的地方使用正則表示式確實特別棒。參考[博文http://blog.csdn.net/yaerfeng/a </p> </div> <div class="r"> <h5><a href="/content/1541838675.html" target="_blank">jxbrowser <font color=red>java</font><font color=red>程式碼</font>直接呼叫js<font color=red>程式碼</font> (破解<font color=red>版</font>請聯絡作者)免license</a></h5> <p> final Browser browser = new Browser(); BrowserView browserView = new BrowserView(browser); JFrame frame = new JFrame(); f </p> </div> <div class="r"> <h5><a href="/content/1544745789.html" target="_blank">一行<font color=red>程式碼</font>搞定二分查詢（<font color=red>java</font><font color=red>版</font>）</a></h5> <p> 效果如圖： public static int rank(double key,double[] a,int lo,int hi){ return lo>hi?-1:key<a[lo+(hi-lo)/2]?rank(key,a,lo,lo+(hi-lo)/2- </p> </div> <div class="r"> <h5><a href="/content/1544861740.html" target="_blank">10行<font color=red>程式碼</font>搞定微信支付(<font color=red>Java</font><font color=red>版</font>)</a></h5> <p> 微信支付痛點 對於大多數同學來說，要開發微信支付可不簡單。 附上微信支付官方文件https://pay.weixin.qq.com/wiki/doc/api/index.html 從文件上可以看出，你需要解決很多問題，我就隨便挑幾個吧。 xml與物件的互轉: 微 </p> </div> <div class="r"> <h5><a href="/content/1545698174.html" target="_blank">【劍指offer】<font color=red>Java</font><font color=red>版</font><font color=red>程式碼</font>（完整版）</a></h5> <p> 一、引言 《劍指offer》可謂是程式猿面試的神書了，在面試中幫了我很多，大部分面試的演算法題都會遇到原題或者是類似的題。但是書上的程式碼都是C版的，我在這裡整理了一份Java版的程式碼供大家學習參考，這些程式碼我都是在OJ上跑過全AC的，所以正確性你大可放心 </p> </div> <div class="r"> <h5><a href="/content/1545705554.html" target="_blank">b樹的實現（2）---<font color=red>java</font><font color=red>版</font><font color=red>程式碼</font></a></h5> <p> 原文地址: http://blog.csdn.net/cdnight/article/details/10619599 [java] view plain copy print? 感覺上，b樹的插入及刪除操作都不如RB樹複雜。當年插紅黑樹的各種操作解釋文章都 </p> </div> <div class="r"> <h5><a href="/content/1545705561.html" target="_blank">【演算法】B+樹的研讀及實現（2）---<font color=red>java</font><font color=red>版</font>核心<font color=red>程式碼</font></a></h5> <p> 【前言】 假如大家已經弄懂了b樹及b+樹那麼恭喜你們了，因為我覺得，b樹及b+樹是檔案系統尤其是資料庫優化的關鍵。 這裡預告一下，下一篇課題（也不能說課題，只能用“業餘研究題目”這種稱呼）是R樹，R樹似乎是多維的B+樹，各位假如也希望弄懂R樹的話，請先好好看看b+樹。 </p> </div> <div class="r"> <h5><a href="/content/1546107678.html" target="_blank">SparkStreaming部分：OutPutOperator類，SaveAsHadoopFile運算元（實際上底層呼叫textFileStream讀取的，跟前兩種有一些區別）【<font color=red>Java</font><font color=red>版</font>純<font color=red>程式碼</font>】</a></h5> <p> package streamingOperate.output; import java.util.Arrays; import org.apache.hadoop.io.IntWritable; import org.apache.hadoop.io.Text; imp </p> </div> <div class="r"> <h5><a href="/content/1546419484.html" target="_blank"><font color=red>java</font><font color=red>版</font>飛機大戰<font color=red>程式碼</font></a></h5> <p> java版飛機大戰程式碼 前言 Plane PlaneStatus類 Power類 play01類 over類 MainFrame主類 MyZiDan 前言 很久之前整理的小東西，這個是從我個人部落格網 </p> </div> <div class="r"> <h5><a href="/content/1546492335.html" target="_blank">C# winform 簡單<font color=red>五子棋</font> 200行<font color=red>程式碼</font>實現<font color=red>人機</font>對戰</a></h5> <p> 1、功能需求接上篇博文，本文描述簡單人機對戰實現過程，只是簡單實現考慮走一步策略，如果要想實現走多步策略，可以在本文估值演算法的基礎上用極大極小值配合剪枝演算法，實現考慮多步策略，這樣ai會顯得更加聰明，後期如果有時間完善，會更新程式碼。2、介面設計參考上一篇博文的介面。3、 </p> </div> <div class="r"> <h5><a href="/content/1546539144.html" target="_blank"><font color=red>java</font><font color=red>版</font> 仿qq<font color=red>程式碼</font> 完整原始碼 （已測試）</a></h5> <p> import javax.swing.Icon; public class ListItem { private String name; private Icon icon; public ListItem(String name,Icon icon){ </p> </div> <div class="r"> <h5><a href="/content/1546786648.html" target="_blank"><font color=red>java</font><font color=red>版</font>app微信支付服務端<font color=red>程式碼</font>【手機app微信支付】</a></h5> <p> 老早就像做支付模組的東西，因為覺得很高大上，很早就開始把微信支付模組的重心簽名給做好了，一直就缺個商家的key，現在有幸來電商公司，哈哈，果然一切很順利，能夠很給力地App端提供支援； 個人覺得核心部分的程式碼： 簽名： //引數：開始生成簽名 SortedMap& </p> </div> <div class="r"> <h5><a href="/content/1546889064.html" target="_blank">SparkSQL建立RDD：UDF（UserDataFrame）使用者建立自定義函式（包含動態建立schema，使用者自定義函式，查詢字元的個數）【<font color=red>Java</font><font color=red>版</font>純<font color=red>程式碼</font>】</a></h5> <p> Java版程式碼： package com.bjsxt; import java.util.ArrayList; import java.util.Arrays; import java.util.List; import org.apache.spark.Spark </p> </div> <div class="r"> <h5><a href="/content/1546902037.html" target="_blank">SparkSQL建立RDD：UDAF（UserDefinedAggregatedFunction）使用者自定義聚合函式【<font color=red>Java</font><font color=red>版</font>純<font color=red>程式碼</font>】</a></h5> <p> 要實現8個方法，8個方法中，最為重要的有3個： initialize：初始化，在給，map端每一個分割槽的每一個key進行初始化，給0 update：在map端聚合 merge： 在reduce端聚合 Java版程式碼： package com.bjsxt; im </p> </div> <div class="r"> <h5><a href="/content/1547232302.html" target="_blank">著色問題的<font color=red>程式碼</font>實現（<font color=red>java</font><font color=red>版</font>）使用回溯法和貪心思想</a></h5> <p> 著色問題描述： 給圖中的結點塗上顏色，相鄰（直接連通）的結點塗的顏色不能相同。 方法1：回溯法： 回溯法求出的塗色方法是全的，塗色方案不止一種。 & </p> </div> <div class="r"> <h5><a href="/content/1547240257.html" target="_blank">SparkStreaming部分：OutPutOperator類，SaveAsTextFile運算元（實際上底層呼叫textFileStream讀取的，呼叫dstream儲存的）【<font color=red>Java</font><font color=red>版</font>純<font color=red>程式碼</font>】</a></h5> <p> package streamingOperate.output; import java.util.Arrays; import org.apache.spark.SparkConf; import org.apache.spark.api.java.function.F </p> </div> <div class="r"> <h5><a href="/content/1547979513.html" target="_blank"><font color=red>java</font><font color=red>版</font>-<font color=red>五子棋</font>-個人-原始碼參考</a></h5> <p> package wuziqi;importjava.io.IOException;importjava.util.*; public class Wuziqi{ public static void main(String args[]) { //五子棋的宣告 int </p> </div> <!-- <ul class="entry-related clearfix"> <li> </li> </ul>--> </div> </div> </article> </div> <aside class="sidebar"> <div id="search-7" class="widget widget_search"> <h3 class="widget-title">搜尋</h3> <form name="formsearch" class="search-form" action="https://www.796t.com/public/api.php" method="get"> <input type="hidden" name="app" value="search"/> <input type="text" class="keyword" name="q" placeholder="輸入關鍵詞..." value=""> <input type="submit" class="submit" value=""> </form> </div> <div id="wpcom-image-ad-4" class="widget widget_image_ad"></div> <div id="tag_cloud-3" class="widget widget_tag_cloud"> <h3 class="widget-title">基礎教學</h3> <div class="tagcloud"> <a href="https://www.796t.com/category.php?cid=18" class="tag-cloud-link tag-link-66 tag-link-position-1" style="font-size: 22pt;">Mysql入門</a> <a href="https://www.796t.com/category.php?cid=19" class="tag-cloud-link tag-link-66 tag-link-position-1" style="font-size: 22pt;">Sql入門</a> <a href="https://www.796t.com/category.php?cid=20" class="tag-cloud-link tag-link-66 tag-link-position-1" style="font-size: 22pt;">Android入門</a> <a href="https://www.796t.com/category.php?cid=21" class="tag-cloud-link tag-link-66 tag-link-position-1" style="font-size: 22pt;">Docker入門</a> <a href="https://www.796t.com/category.php?cid=22" class="tag-cloud-link tag-link-66 tag-link-position-1" style="font-size: 22pt;">Go語言入門</a> <a href="https://www.796t.com/category.php?cid=23" class="tag-cloud-link tag-link-66 tag-link-position-1" style="font-size: 22pt;">Ruby程式入門</a> <a href="https://www.796t.com/category.php?cid=24" class="tag-cloud-link tag-link-66 tag-link-position-1" style="font-size: 22pt;">Python入門</a> <a href="https://www.796t.com/category.php?cid=25" class="tag-cloud-link tag-link-66 tag-link-position-1" style="font-size: 22pt;">Python進階</a> <a href="https://www.796t.com/category.php?cid=26" class="tag-cloud-link tag-link-66 tag-link-position-1" style="font-size: 22pt;">Django入門</a> <a href="https://www.796t.com/category.php?cid=27" class="tag-cloud-link tag-link-66 tag-link-position-1" style="font-size: 22pt;">Python爬蟲入門</a> </div> </div> <div id="wpcom-image-ad-12" class="widget widget_image_ad"> </div> <div id="wpcom-post-thumb-3" class="widget widget_post_thumb"> <h3 class="widget-title">最近訪問</h3> <ul> <p><a href="/content/.html" style="font-size:16px;"> </a> </p> </ul> </div> </aside> </div> </div> <footer class="footer"> <div class="container"> <div class="clearfix"> <div class="footer-col footer-col-copy"> <ul class="footer-nav hidden-xs"> <li id="menu-item-109589" class="menu-item current-menu-item current_page_item menu-item-109589"><a href="https://www.796t.com/" aria-current="page">首頁</a></li><li class="menu-item menu-item-373"><a href="https://www.796t.com/category.php?cid=9">前端設計</a></li><li class="menu-item menu-item-373"><a href="https://www.796t.com/category.php?cid=10">程式設計</a></li><li class="menu-item menu-item-373"><a href="https://www.796t.com/category.php?cid=13">免費資源</a></li><li class="menu-item menu-item-373"><a href="https://www.796t.com/category.php?cid=14">實用技巧</a></li><li class="menu-item menu-item-373"><a href="https://www.796t.com/category.php?cid=15">資料庫</a></li><li class="menu-item menu-item-373"><a href="https://www.796t.com/category.php?cid=29">資訊</a></li><li class="menu-item menu-item-373"><a href="https://www.3du.tw/zidian.php">字典</a></li></ul> <div class="copyright"> <p>Copyright © 2002-2020 <a href="https://www.796t.com/">程式人生</a> 796T.COM All rights reserved. </p> </div> </div> <div class="footer-col footer-col-sns"> <div class="footer-sns"> </div> </div> </div> </div> </footer> <style> .footer{padding-bottom: 20px;} </style> <script type="text/javascript" src="/css/main.js"></script> <script type="text/javascript" src="/css/wp-embed.js"></script> <script type="text/javascript" src="/css/lazysizes.min.js"></script> <script src="https://cdn.jsdelivr.net/gh/highlightjs/cdn-release@10.1.2/build/highlight.min.js"></script> <link rel="stylesheet" href="https://cdn.jsdelivr.net/npm/highlight.js@10.1.2/styles/atelier-estuary-light.css"> <script>hljs.initHighlightingOnLoad();</script> </body> </html>
