最近好久没有来，主要是迷上了黑白棋，自己写了个小程序，发上来大家帮忙看看
个人觉得最大的亮点是用到了正则，速度应该比用其它方法要快，谁还有更好的不妨发来一起学习，我的个人邮箱shouhaimu@yahoo.com.cn，最近QQ老被盗，就不附QQ了。要联系的可以看我资料。

<style> table{ text-align:center; vertical-align: bottom; } td{ padding-top:2px; } </style> <script> /*=====================================*/ //Author:shouhaimu //E-mail:shouhaimu@yahoo.com.cn /*=====================================*/ //初始参数 /*=====================================*/ var max_num=100; var random_k=0.1; var huanhang=String.fromCharCode(13,10); var user,deepth,first,b2_i,winner=2,lock,pass,times=0,wintimes=0,gameover,step,step_0,step_1; var str_color=new Array('<font color="blue">','<font color="red">'); var buffer=new Array(); //棋局暂存 var buffer1=new Array(); //先手暂存 var buffer2=new Array(); //落点图谱 var buffer3=new Array(); //图谱字串 var buffer4=new Array(); //落点序列 var buffer5=new Array(); //落点序列 var map_now=new Array(); //当前棋局 var _size=8,_S1=_size+1; i=-1;while(++i<_size*_S1)map_now[i]=0; i=-1;while(++i<_size) map_now[i*_S1+_size]=9; HS=Math.floor(_size/2); map_now[(HS-1)*_S1+HS-1]=2; map_now[(HS-1)*_S1+HS]=1; map_now[HS*_S1+HS-1]=1; map_now[HS*_S1+HS]=2; map_now[(HS-1)*_S1+HS-2]=3; map_now[(HS-2)*_S1+HS-1]=3; map_now[(HS)*_S1+HS+1]=3; map_now[(HS+1)*_S1+HS]=3; buffer[0]=map_now.join(''); /*=====================================*/ //绘制盘面函数 /*=====================================*/ var dot=new Array('','●','○','&#215;'); var map_str=new Array(); map_str[1] ='<tr><td onclick="init(1);test();" width="12%">※</td>'; map_str[2] ='<td width="11%">A</td>'; map_str[3] ='<td width="11%">B</td>'; map_str[4] ='<td width="11%">C</td>'; map_str[5] ='<td width="11%">D</td>'; map_str[6] ='<td width="11%">E</td>'; map_str[7] ='<td width="11%">F</td>'; map_str[8] ='<td width="11%">G</td>'; map_str[9] ='<td width="11%">H</td></tr>'; map_str[_size*_size+10]='</table>'; function redraw(){ temp=document.body.clientHeight-50; txt_2.style.left=temp+25; map_str[0] ='<table id=mtable width='+temp+' height='+temp+' style="font-size:'+temp/12+'px;" border=1 cellpadding=0 cellspacing=0>'; i=-1; while(++i<_size){ j=-1; while(++j<_size) map_str[i*_size+j+10]='<td bgcolor="#ff9900" onclick="player('+(i*_S1+j)+')">'+(map_now[i*_S1+j]!=3?dot[map_now[i*_S1+j]]:scorce[i*_S1+j])+'</td>'; map_str[i*_size+10] = '<tr><td>'+(i+1)+'</td>'+map_str[i*_size+10]; map_str[i*_size+_size+9]+= '</tr>'; } return map_str.join(''); } /*=====================================*/ //初始化 /*=====================================*/ function init(v){ lock=first=true; user=v; step_0=step=0; buffer1[0]=0; buffer2[0]=new Array(21,29,41,49); buffer3=new Array(); buffer3[0]='D3,C4,F5,E6'; buffer5[0]=new Array(); buffer5[0][21]=buffer5[0][29]=buffer5[0][41]=buffer5[0][49]=0; map_now=buffer[0].split(''); container.innerHTML=redraw(); gameover=false; lock=false; } /*=====================================*/ //随机测试 /*=====================================*/ var windots_1=0,windots_2=0; function test(){ if(gameover){ temp=buffer[step_0]; windots_1+=i=temp.replace(/[^1]/g,'').length; windots_2+=j=temp.replace(/[^2]/g,'').length; times++; if(i<j) wintimes++; txt_2.innerHTML=wintimes*100/times+'%,'+dot[1]+':'+dot[2]+'='+windots_1+':'+windots_2; if(times>=max_num) return ; init(1); } v=buffer2[step_0][Math.floor(buffer2[step_0].length*Math.random())]; beforeOthello(v); Othello(v); if(step%2+user==2&&!gameover)computer(); setTimeout('test();',0); } /*=====================================*/ //电脑下棋 /*=====================================*/ function computer(){ var i=-1,j=buffer2[step_0].length,k,temp,temp2,temp3,v=buffer2[step_0][0]; k=assess(v); Othello(v); if(step%2+1==user) temp3=buffer2[step_0].length; else temp3=0; back(); while(++i<j){ temp=buffer2[step_0][i]; temp2=assess(temp); if(temp2<k){ k=temp2; v=temp; } } beforeOthello(v); Othello(v); if(step%2+user==2&&!gameover)computer(); } /*=====================================*/ //计算行棋后对方行动力并对落点进行评估 //目前胜率为93%左右(最后更新2006.7.4) /*=====================================*/ var nearby=new Array(-10,-9,-8,-1,1,8,9,10); var count=new Array(-9,4,-1,-1,8,0,-4,1,1,0); var scorce=new Array( count[0], count[1], count[2], count[3], count[3], count[2], count[1], count[0], 0, count[1], count[4], count[7], count[8], count[8], count[7], count[4], count[1], 0, count[2], count[7], count[5], count[9], count[9], count[5], count[7], count[2], 0, count[3], count[8], count[9], count[6], count[6], count[9], count[8], count[3], 0, count[3], count[8], count[9], count[6], count[6], count[9], count[8], count[3], 0, count[2], count[7], count[5], count[9], count[9], count[5], count[7], count[2], 0, count[1], count[4], count[7], count[8], count[8], count[7], count[4], count[1], 0, count[0], count[1], count[2], count[3], count[3], count[2], count[1], count[0], 0 ); function assess(v){ temp=scorce[v]; i=-1; while(++i<_size){ k=v+nearby[i]; if(map_now[k]==0){ temp-=scorce[k]; if(map_now[k]==map_now[v-nearby[i]]) temp++; if(map_now[k+nearby[i]]==user) temp--; if(map_now[v-nearby[i]]==user) temp-=scorce[v]+scorce[k]; if(map_now[k+nearby[i]]==3-user) temp++; }else{ temp--; if(map_now[k]==map_now[v-nearby[i]]) temp--; if(map_now[k]==user) temp--; if(map_now[k]==3-user) temp+=scorce[k]; } } return temp; } /*=====================================*/ //标记行动力并计算食子数 /*=====================================*/ function mark(k){ if(map_now[k]!=0) return; map_now[k]=4; map_now=map_now.join('').replace(/2/g,'5').replace(/1/g,'2').replace(/5/g,'1'); temp=fanzhuan(); eat_points=map_now.replace(/[^2]/g,'').length-temp.replace(/[^2]/g,'').length; map_now=map_now.replace(/2/g,'5').replace(/1/g,'2').replace(/5/g,'1').split(''); if(eat_points>0){ map_now[k]=3; buffer5[step_0][k]=eat_points-1; buffer2[step_0][b2_i++]=k; pass=false; }else{ map_now[k]=0; } } /*=====================================*/ //计算落子对盘面的影响 /*=====================================*/ function Othello(v){ buffer4[step_0]=v; step_0++; map_now[v]=4; map_now=map_now.join('').replace(/3/g,'0'); if(step%2) map_now=map_now.replace(/2/g,'5').replace(/1/g,'2').replace(/5/g,'1'); map_now=fanzhuan().split(''); map_now[v]=1; buffer2[step_0]=new Array(); buffer5[step_0]=new Array(); b2_i=0; pass=true; k=-1; while(++k<_size*_S1){ if(k%_S1==_size)k++; mark(k); } if(pass){ map_now=map_now.join('').replace(/2/g,'5').replace(/1/g,'2').replace(/5/g,'1').split(''); k=-1; while(++k<_size*_S1){ if(k%_S1==_size)k++; mark(k); } if(pass){ first=false; gameover=true; } step++; } if(step%2) map_now=map_now.join('').replace(/2/g,'5').replace(/1/g,'2').replace(/5/g,'1').split(''); buffer[step_0]=map_now.join(''); buffer1[step_0]=++step; } /*=====================================*/ //翻转正则匹配 /*=====================================*/ i1=/1(2)+4/; i2=/4(2)+1/; i3=/1.{9}(2.{9})+4/; i4=/4.{9}(2.{9})+1/; i5=/1.{7}(2.{7})+4/; i6=/4.{7}(2.{7})+1/; i7=/1.{8}(2.{8})+4/; i8=/4.{8}(2.{8})+1/; /*=====================================*/ //翻转函数 /*=====================================*/ function fanzhuan(){ map_tmp=map_now; //----------------------------------------------------------- i=map_tmp.match(i1); if(i) map_tmp=map_tmp.replace(i[0],i[0].replace(/2/g,'1')); i=map_tmp.match(i2); if(i) map_tmp=map_tmp.replace(i[0],i[0].replace(/2/g,'1')); //----------------------------------------------------------- //||||||||||||||||||||||||||||||||||||||||||||||||||||||||||| i=map_tmp.match(i7); if(i){ temp=i[0].split(''); j=0; while(++j<temp.length/9-1)temp[j*9]=1; map_tmp=map_tmp.replace(i[0],temp.join('')); } i=map_tmp.match(i8); if(i){ temp=i[0].split(''); j=0; while(++j<temp.length/9-1)temp[j*9]=1; map_tmp=map_tmp.replace(i[0],temp.join('')); } //||||||||||||||||||||||||||||||||||||||||||||||||||||||||||| //\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\ i=map_tmp.match(i3); if(i){ temp=i[0].split(''); j=0; while(++j<temp.length/10-1)temp[j*10]=1; map_tmp=map_tmp.replace(i[0],temp.join('')); } i=map_tmp.match(i4); if(i){ temp=i[0].split(''); j=0; while(++j<temp.length/10-1)temp[j*10]=1; map_tmp=map_tmp.replace(i[0],temp.join('')); } //\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\\ ///////////////////////////////////////////////////////////// i=map_tmp.match(i5); if(i){ temp=i[0].split(''); j=0; while(++j<temp.length/8-1)temp[j*8]=1; map_tmp=map_tmp.replace(i[0],temp.join('')); } i=map_tmp.match(i6); if(i){ temp=i[0].split(''); j=0; while(++j<temp.length/8-1)temp[j*8]=1; map_tmp=map_tmp.replace(i[0],temp.join('')); } ///////////////////////////////////////////////////////////// return map_tmp; } /*=====================================*/ //获取棋谱 /*=====================================*/ function LoadPage(URL){ if(!URL)URL='temp.txt'; /*--------------------------------------------------------------*/ /* Create a new XMLHttpRequest object to talk to the Web server */ /*--------------------------------------------------------------*/ var xmlHttp = false; try{ xmlHttp = new ActiveXObject("Msxml2.XMLHTTP"); }catch(e){ try{ xmlHttp = new ActiveXObject("Microsoft.XMLHTTP"); }catch(e2){ xmlHttp = false; } } if (!xmlHttp && typeof(XMLHttpRequest)!= 'undefined')xmlHttp = new XMLHttpRequest(); /*--------------------------------------------------------------*/ self.onerror=null; xmlHttp.open("GET", URL, false); xmlHttp.send(); if(xmlHttp.status == 404) return null; return xmlHttp.responseText; } /*=====================================*/ //保存棋谱，带参数为保存到本地文件 /*=====================================*/ var SaveBuffer; function Save(v){ SaveBuffer=buffer4.join(','); if(v){ try{ var fso = new ActiveXObject("Scripting.FileSystemObject"); var folderspec=this.location.pathname.replace("/",""); folderspec=folderspec.replace(fso.GetFileName(folderspec),"").replace("\\","\\\\"); if(lock||status=='saved') return; var tf = fso.CreateTextFile(folderspec+"save.txt", true); tf.Write(SaveBuffer); tf.Close(); }catch(e){ status='fail'; v=false; } if(v) status='saved:'+folderspec+"save.txt"; } } /*=====================================*/ //载入棋谱，带参数为从文件中加载 /*=====================================*/ function Load(v){ if(v) SaveBuffer=LoadPage(); if(SaveBuffer){ buffer4=SaveBuffer.split(','); deepth=buffer4.length; init(0); replay(); } } /*=====================================*/ //推演棋局 /*=====================================*/ function replay(){ if(step_0<deepth){ beforeOthello([buffer4[step_0]]) Othello([buffer4[step_0]]); afterOthello(); setTimeout("replay();",500); } } /*=====================================*/ //人下棋 /*=====================================*/ function player(v){ if(map_now[v]!=3||lock) return; //落点非法或过快 beforeOthello(v); Othello(v); if(step%2+user==2&&!gameover)computer(); afterOthello(); } /*=====================================*/ //下棋前 /*=====================================*/ function beforeOthello(v){ lock=true; buffer3[step_0]=buffer2[step_0].join(',').replace(v,str_color[step%2]+str_drop(v)+'</font>'); } /*=====================================*/ //下棋后 /*=====================================*/ function afterOthello(){ txt_2.innerHTML=buffer3.join('<br>'); container.innerHTML=redraw(); status='nosave'; lock=false; if(gameover) alert(dot[1]+':'+dot[2]+'='+buffer[step_0].replace(/[^1]/g,'').length+':'+buffer[step_0].replace(/[^2]/g,'').length); } /*=====================================*/ //悔棋 /*=====================================*/ function goback(){ back(); if(gameover)gameover=false; afterOthello(); } function back(){ buffer3[step_0]=null; map_now=buffer[--step_0].split(''); step=buffer1[step_0]; } /*=====================================*/ //人机换子 /*=====================================*/ function ChangeUser(){ if(!gameover){ user=2-buffer1[step_0]%2; computer(); afterOthello(); } } /*=====================================*/ //一维与二维坐标变换 /*=====================================*/ function str_drop(v){ return String.fromCharCode(v%_S1+65)+Math.floor(v/_S1+1); } function drop_str(v){ v=v.replace(/G/,'4').replace(/H/,'3').split(''); return (v[1]-1)*_S1+Math.abs(eval('0x'+v[0])-10); } /*=====================================*/ </script> <body onload="init(1);"> <div id=txt_2 style="position:absolute;"></div> <div id=container style="cursor:hand;"></div> <input type=button onclick="Save();" value="保存"> <input type=button onclick="Load();" value="打谱"> <input type=button onclick="init(1);" value="开局"> <input type=button onclick="ChangeUser();" value="换手"> <input type=button onclick="goback();" value="悔棋"> </body>
 提示：您可以先修改部分代码再运行

好东西，收藏，，学习中。。。

电脑不能自己走棋的啊....有点失望.......楼主再努力努力？呵呵

可以的，只不过没有显示出来，单击※试试

不错！我以前学C++时也写过！ 最近学WEB编程！向楼主学习

小问一下，电脑相当于什么级别的选手？？

低？中？高？