自己写的javascript五子棋

最新推荐文章于 2023-11-03 23:22:57 发布
最新推荐文章于 2023-11-03 23:22:57 发布
阅读量945 收藏 1
点赞数 1
文章标签： javascript c function null div html
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/spring1986/article/details/5631744
版权

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html>
  <head>
    <title>five-in-a-raw</title>
    <meta http-equiv="content-type" content="text/html; charset=UTF-8">
    <style>
 <!--
  table{text-align: center;font-size: 20px;cursor: hand;empty-cells: show;table-layout: fixed;}
 -->
 </style>
  </head>
  <script type="text/javascript">
 <!--
 function FiveRawGame(){
  this.redChess="<font color=/"red/">X</font>";
  this.blackChess="<font color='black'>O</font>";
  //初始化棋盘和数据
  this.init=function(){
   var str="<table  width=/"600/" height=/"600;/" border=/"1/" cellpadding=/"0/" cellspacing=/"0/"  >";
   for(var i=0;i<25;i++){
    str+="<tr height='7'>";
    for(var j=0;j<25;j++){
     str+="<td id='r"+i+"c"+j+"' οnclick=/"FiveRawGame.chess("+i+","+j+")/" οnmοuseοver=/"FiveRawGame.showMsg("+i+","+j+")/">&nbsp;</td>";
    }
    str+="</tr>";
   }
   str+="</table>";
   document.getElementById("main").innerHTML=str;
   this.allGrids=new Array();
   for(var a=0;a<25;a++){
    this.allGrids[a]=new Array();
   }
   for(var i=0;i<25;i++){
    for(var j=0;j<25;j++){
     this.allGrids[i][j]=new grid(i,j,"O");
    }
   }
   this.isChess=true;
   this.redArr=new Array();
   this.blackArr=new Array();
   this.allArr=new Array();
  };
 }
 FiveRawGame.prototype.chess=function(i,j){
  if(this.isChess&&this.allGrids[i][j].piece=='O'){
   document.getElementById("r"+i+"c"+j).innerHTML=this.blackChess;
   this.isChess=false;
   this.allGrids[i][j].piece="B";
   //把该步棋子装入黑方数组
   this.blackArr[this.blackArr.length]=this.allGrids[i][j];
   this.allArr[this.allArr.length]=this.allGrids[i][j];
   //判断输赢 赢则结束游戏
   //给该棋子8个方向的棋子赋值
   this.insertPiece(i,j,'B');
   //调用红方下子
   this.computerChess();
  }else{
   document.getElementById("msg").innerHTML="请等红方下完!";
  }
 };
 FiveRawGame.prototype.computerChess=function(){//电脑下棋
  //1、找玩家最后一颗棋子四个方向个有几个？顺便赋值
  var hasGrid;
  hasGrid=this.assignPiece(this.blackArr[this.blackArr.length-1]);
  if(hasGrid==null||hasGrid==false)return;
  //2、找自己是否有走一颗棋子就直接胜利的位置
   hasGrid=this.enumeration("R",1);
   if(hasGrid==null||hasGrid==false){
    //3、找对方是否有走一颗棋子就直接胜利的位置
     hasGrid=this.enumeration("B",1);
     if(hasGrid==null||hasGrid==false){
      //4、找对方是否有走一颗棋子就堵不住的位置
      hasGrid=this.enumeration("B",2);
      if(hasGrid==null||hasGrid==false){
      //5、找自己是否有走一颗棋子就堵不住的位置
       hasGrid=this.enumeration("R",2);
       if(hasGrid==null||hasGrid==false){
        //6、否则找最优最好位置堵
        hasGrid=this.assignPiece(this.blackArr[this.blackArr.length-1]);
        if(hasGrid==null||hasGrid==false)return;
        if(hasGrid==true){
         for(var j=this.redArr.length-1;j>=0;j--){
          hasGrid=this.assignPiece(this.redArr[j]);
          if(hasGrid!=null&&hasGrid!=false&&hasGrid!==true)
          break;
         }
        }
       }
      }
     }
   }
  var r=hasGrid.rowNum;
  var c=hasGrid.colNum;
  this.allGrids[r][c].piece="R";
  document.getElementById("r"+r+"c"+c).innerHTML=this.redChess;
  this.redArr[this.redArr.length]=this.allGrids[r][c];
  this.allArr[this.allArr.length]=this.allGrids[r][c];
  this.isChess=true;
  //给该棋子8个方向的棋子赋值
  this.insertPiece(r,c,'R');
  this.assignPiece(this.allGrids[r][c]);
  return;
 };
 //找出这个棋子四个方向的数量，并且返回该棋子四周最好下子的位置
 FiveRawGame.prototype.assignPiece=function(grid){
  var piece=grid.piece;
  this.goodChess=new Array();
  //横向
  var count=0;
  var r=grid.rowNum;
  var c=grid.colNum;
  //alert(r+","+c+","+piece);
  do{c--;}while(c>=0&&this.allGrids[r][c].piece==piece);
  this.goodChess[this.goodChess.length]=this.allGrids[r][c];
  do{c++;count++;}while(c<25&&this.allGrids[r][c].piece==piece);
  this.goodChess[this.goodChess.length]=this.allGrids[r][c];
  this.allGrids[grid.rowNum][grid.colNum].num1=count-1;
  var num1=count-1;
  //alert(r+","+c+","+this.allGrids[r][c].piece+","+(count-1));
  //竖向
  var count=0;
  var r=grid.rowNum;
  var c=grid.colNum;
  do{r--;}while(r>=0&&this.allGrids[r][c].piece==piece);
  this.goodChess[this.goodChess.length]=this.allGrids[r][c];
  do{r++;count++;}while(r<25&&this.allGrids[r][c].piece==piece);
  this.goodChess[this.goodChess.length]=this.allGrids[r][c];
  this.allGrids[grid.rowNum][grid.colNum].num2=count-1;
  var num2=count-1;
  //撇向
  var count=0;
  var r=grid.rowNum;
  var c=grid.colNum;
  do{r++;c--;}while(r<25&&c>=0&&this.allGrids[r][c].piece==piece);
   this.goodChess[this.goodChess.length]=this.allGrids[r][c];
  do{r--;c++;count++;}while(r>=0&&c<25&&this.allGrids[r][c].piece==piece);
   this.goodChess[this.goodChess.length]=this.allGrids[r][c];
  this.allGrids[grid.rowNum][grid.colNum].num3=count-1;
  var num3=count-1;
  //捺向
  var count=0;
  var r=grid.rowNum;
  var c=grid.colNum;
  do{r--;c--;}while(c>=0&&this.allGrids[r][c].piece==piece&&r>=0);
   this.goodChess[this.goodChess.length]=this.allGrids[r][c];
  do{r++;c++;count++;}while(r<25&&c<25&&this.allGrids[r][c].piece==piece);
   this.goodChess[this.goodChess.length]=this.allGrids[r][c];
  this.allGrids[grid.rowNum][grid.colNum].num4=count-1;
  var num4=count-1;
  var maxValue=0;
  maxValue=Math.max(num1,num2);
  maxValue=Math.max(maxValue,num3);
  maxValue=Math.max(maxValue,num4);
  if(maxValue>=5){
   if(piece=='R'){
    alert("红方胜出!");
    if(window.confirm("是否重新开局?")){
    this.init();
    }
    return false;
   }else if(piece=='B'){
    alert("黑方胜出!");
    if(window.confirm("是否重新开局?")){
    this.init();
    }
    return false;
   }
  }
  //判断哪个值与最大值相同
  if(maxValue==num1){
   if(this.goodChess[0].piece=="O")return this.goodChess[0];
   if(this.goodChess[1].piece=="O")return this.goodChess[1];
  }
  if(maxValue==num2){
   if(this.goodChess[2].piece=="O")return this.goodChess[2];
   if(this.goodChess[3].piece=="O")return this.goodChess[3];
  }
  if(maxValue==num3){
   if(this.goodChess[4].piece=="O")return this.goodChess[4];
   if(this.goodChess[5].piece=="O")return this.goodChess[5];
  }
  if(maxValue==num4){
   if(this.goodChess[6].piece=="O")return this.goodChess[6];
   if(this.goodChess[7].piece=="O")return this.goodChess[7];
  }
  return true;
 };
 FiveRawGame.prototype.insertPiece=function(i,j,piece){
  var row=i;
  var col=j;
  //找出四个方向的属于自己的棋子并且逐个加1
  while(row-1>=0&&col-1>=0&&this.allGrids[row-1][col-1].piece==piece){//左上
   this.allGrids[row-1][col-1].num4=this.allGrids[row-1][col-1].num4+1;
   row--;
   col--;
   if(this.allGrids[row-1][col-1].piece!=piece)break;
  }
  row=i;
  col=j;
  while(row-1>0&&this.allGrids[row-1][col].piece==piece){//上
   this.allGrids[row-1][col].num4=this.allGrids[row-1][col].num4+1;
   row--;
   if(this.allGrids[row-1][col].piece!=piece)break;
  }
  row=i;
  col=j;
  while(row-1>=0&&col+1>=0&&this.allGrids[row-1][col+1].piece==piece){//右上
   this.allGrids[row-1][col+1].num4=this.allGrids[row-1][col+1].num4+1;
   row--;
   col++;
   if(this.allGrids[row-1][col+1].piece!=piece)break;
  }
  row=i;
  col=j;
  while(col-1>0&&this.allGrids[row][col-1].piece==piece){//左
   this.allGrids[row][col-1].num4=this.allGrids[row][col-1].num4+1;
   col--;
   if(this.allGrids[row][col-1].piece!=piece)break;
  }
  row=i;
  col=j;
  while(col+1>0&&this.allGrids[row][col+1].piece==piece){//右
   this.allGrids[row][col+1].num4=this.allGrids[row][col+1].num4+1;
   col++;
   if(this.allGrids[row][col+1].piece!=piece)break;
  }
  row=i;
  col=j;
  while(row+1>=0&&col-1>=0&&this.allGrids[row+1][col-1].piece==piece){//左下
   this.allGrids[row+1][col-1].num4=this.allGrids[row+1][col-1].num4+1;
   row++;
   col--;
   if(this.allGrids[row+1][col-1].piece!=piece)break;
  }
  row=i;
  col=j;
  while(row+1>0&&this.allGrids[row+1][col].piece==piece){//下
   this.allGrids[row+1][col].num4=this.allGrids[row+1][col].num4+1;
   row++;
   if(this.allGrids[row+1][col].piece!=piece)break;
  }
  row=i;
  col=j;
  while(row+1>=0&&col+1>=0&&this.allGrids[row+1][col+1].piece==piece){//右下
   this.allGrids[row+1][col+1].num4=this.allGrids[row+1][col+1].num4+1;
   row++;
   col++;
   if(this.allGrids[row+1][col+1].piece!=piece)break;
  }
 };
 FiveRawGame.prototype.enumeration=function(piece,stype){
  var checks=this.allGrids;
  var canX="";
  //找出所有没有下棋子的，并且在距离它两个子内没有棋子的
  var len=this.allArr.length;
  for(var i=0;i<len;i++){
   var r=this.allArr[i].rowNum;
   var c=this.allArr[i].colNum;
   //找该棋子附近的24个位置
   if(r-2>=0&&c-2>=0&&checks[r-2][c-2].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r-2)+","+(c-2);
   if(r-2>=0&&c-1>=0&&checks[r-2][c-1].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r-2)+","+(c-1);
   if(r-2>=0&&checks[r-2][c].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r-2)+","+(c);
   if(r-2>=0&&c+1<25&&checks[r-2][c+1].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r-2)+","+(c+1);
   if(r-2>=0&&c+2<25&&checks[r-2][c+2].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r-2)+","+(c+2);
   if(r-1>=0&&c-2>=0&&checks[r-1][c-2].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r-1)+","+(c-2);
   if(r-1>=0&&c-1>=0&&checks[r-1][c-1].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r-1)+","+(c-1);
   if(r-1>=0&&checks[r-1][c].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r-1)+","+(c);
   if(r-1>=0&&c+1<25&&checks[r-1][c+1].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r-1)+","+(c+1);
   if(r-1>=0&&c+2<25&&checks[r-1][c+2].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r-1)+","+(c+2);
   if(c-2>=0&&checks[r][c-2].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r)+","+(c-2);
   if(c-1>=0&&checks[r][c-1].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r)+","+(c-1);
   if(c+1<25&&checks[r][c+1].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r)+","+(c+1);
   if(c+2<25&&checks[r][c+2].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r)+","+(c+2);
   if(r+1>=0&&c-2>=0&&checks[r+1][c-2].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r+1)+","+(c-2);
   if(r+1>=0&&c-1>=0&&checks[r+1][c-1].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r+1)+","+(c-1);
   if(r+1>=0&&checks[r+1][c].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r+1)+","+(c);
   if(r+1>=0&&c+1<25&&checks[r+1][c+1].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r+1)+","+(c+1);
   if(r+1>=0&&c+2<25&&checks[r+1][c+2].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r+1)+","+(c+2);
   if(r+2>=0&&c-1>=0&&checks[r+2][c-2].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r+2)+","+(c-2);
   if(r+2>=0&&c-1>=0&&checks[r+2][c-1].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r+2)+","+(c-1);
   if(r+2>=0&&checks[r+2][c].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r+2)+","+(c);
   if(r+2>=0&&c+1<25&&checks[r+2][c+1].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r+2)+","+(c+1);
   if(r+2>=0&&c+2<25&&checks[r+2][c+2].piece=="O")if(canX.indexOf(r+","+c)==-1)canX+="@"+(r+2)+","+(c+2);
  }
  var arrlen=canX.split("@");
  for(var j=0;j<arrlen.length;j++){
   if(arrlen[j]!=null&&arrlen[j]!=""){
    var r=arrlen[j].split(",")[0];
    var c=arrlen[j].split(",")[1];
    checks=new Array();
    checks=this.allGrids;
    //把棋子放在这个位置，看能发生什么状况
    checks[r][c].piece=piece;
    var has=findGD(r,c,checks,stype);
    this.allGrids[r][c].piece="O";
    if(has){
     return this.allGrids[r][c];
    }
   }
  }
  return false;
 };
 function findGD(sr,sc,checks,stype){
  var grid=checks[sr][sc];
  var piece=grid.piece;
  var testChess=new Array();
  //横向
  var count=0;
  var r=sr;
  var c=sc;
  while(c>0&&checks[r][c].piece==piece){c--;}
  testChess[testChess.length]=checks[r][c];
  do{c++;count++;}while(c<24&&checks[r][c].piece==piece);
  testChess[testChess.length]=checks[r][c];
  checks[grid.rowNum][grid.colNum].num1=count-1;
  var num1=count-1;
  //竖向
  var count=0;
  var r=sr;
  var c=sc;
  while(r>0&&checks[r][c].piece==piece){r--;}
  testChess[testChess.length]=checks[r][c];
  do{r++;count++;}while(r<24&&checks[r][c].piece==piece);
  testChess[testChess.length]=checks[r][c];
  checks[grid.rowNum][grid.colNum].num2=count-1;
  var num2=count-1;
  //撇向
  var count=0;
  var r=sr;
  var c=sc;
  while(r<24&&c>0&&checks[r][c].piece==piece){r++;c--;}
   testChess[testChess.length]=checks[r][c];
  do{r--;c++;count++;}while(r>0&&c<24&&checks[r][c].piece==piece);
   testChess[testChess.length]=checks[r][c];
  checks[grid.rowNum][grid.colNum].num3=count-1;
  var num3=count-1;
  //捺向
  var count=0;
  var r=sr;
  var c=sc;
  while(c>0&&r>0&&checks[r][c].piece==piece){r--;c--;}
   testChess[testChess.length]=checks[r][c];
  do{r++;c++;count++;}while(r<24&&c<24&&checks[r][c].piece==piece);
   testChess[testChess.length]=checks[r][c];
  checks[grid.rowNum][grid.colNum].num4=count-1;
  var num4=count-1;
  var maxValue=0;
  maxValue=Math.max(num1,num2);
  maxValue=Math.max(maxValue,num3);
  maxValue=Math.max(maxValue,num4);
  var allNum=0;
  //判断哪个值与最大值相同
  if(maxValue==num1){
   if(maxValue>=5)return true;
   if(stype==2&&maxValue==4&&testChess[0].piece=="O"&&testChess[1].piece=="O")return true;
   if(stype==2&&maxValue==3&&testChess[0].piece=="O"&&testChess[1].piece=="O")allNum++;
  }
  if(maxValue==num2){
   if(maxValue>=5)return true;
   if(stype==2&&maxValue==4&&testChess[2].piece=="O"&&testChess[3].piece=="O")return true;
   if(stype==2&&maxValue==3&&testChess[2].piece=="O"&&testChess[3].piece=="O")allNum++;
  }
  if(maxValue==num3){
   if(maxValue>=5)return true;
   if(stype==2&&maxValue==4&&testChess[4].piece=="O"&&testChess[5].piece=="O")return true;
   if(stype==2&&maxValue==3&&testChess[4].piece=="O"&&testChess[5].piece=="O")allNum++;
  }
  if(maxValue==num4){
   if(maxValue>=5)return true;
   if(stype==2&&maxValue==4&&testChess[6].piece=="O"&&testChess[7].piece=="O")return true;
   if(stype==2&&maxValue==3&&testChess[6].piece=="O"&&testChess[7].piece=="O")allNum++;
  }
  if(allNum>1){
   return true;
  }else{
   return false;
  }
 }
 FiveRawGame.prototype.showMsg=function (i,j){
  var grid=this.allGrids[i][j];
  var msg="坐标:X:"+i+",Y:"+j;
  //+"<br>"+grid.piece;
  document.getElementById("showMsg").innerHTML=msg;
 };
 //格子对象
 function grid(r,c,piece){
  this.rowNum=r;
  this.colNum=c;
  this.piece=piece;
  //4个方向各有几个自己的棋子
  this.num1=0;//横
  this.num2=0;//竖
  this.num3=0;//撇
  this.num4=0;//捺
 };
 //-->
 </script>
  <body bgcolor="#ffffff" >
   <div id="main" style="float: left;width: 60%;">
   </div>
   <div style="float:right;width: 35%;" >
    <b style="color:red;">红方:&nbsp;&nbsp;&nbsp;&nbsp;X&nbsp;&nbsp;&nbsp;&nbsp;电脑</b><br><br>
    <b style="color:black;">黑方:&nbsp;&nbsp;&nbsp;&nbsp;O&nbsp;&nbsp;&nbsp;&nbsp;玩家</b><br><br>
    <b style="color:black;">黑方先手！</b><br><br>
    <div id="msg" style="color: green;font-size: 20;"></div>
    <div id="showMsg" style="color: green;font-size: 20;"></div>
    <div id="error" style="color: green;font-size: 20;"></div>
   </div>
  </body>
<script type="text/javascript">
<!--
 function   document.oncontextmenu(){event.returnValue=false;}//屏蔽鼠标右键
 window.FiveRawGame=new FiveRawGame();
 FiveRawGame.init();
//-->
</script>   
</html>

 

<!--上面代码复制保存，欢迎交流指正-->

春春
关注
javascript 五子棋
01-11
该游戏用javascript编写，经典而富有独特创意，希望对大家能够有所帮助。
javascript五子棋
aspwebchh的专栏
08-06 981
五子棋 div{margin:0;padding:0;} div.board{width:561px; height:561px; border:1px solid #ccc; margin:0 auto;} div.board div{ width:31px; height:31px; border:1px solid #ccc; float:left; cursor:poin
JavaScript五子棋
梧桐下的四叶草
05-27 593
这个代码是按照网上一个JS教程写的。 这个代码有点bug吧，那就是一直封你的棋而不会去赢。 html： 五子棋 JS： var chessBoard = []; var me = true; var over = false; v
javascript五子棋源码
05-05
JavaScript五子棋源码是一个基于Web的五子棋游戏实现，使用了JavaScript这门流行的客户端编程语言。在本文中，我们将深入探讨JavaScript五子棋源码的各个方面，包括基本概念、核心逻辑、用户交互以及可能涉及的技术...
基于JavaScript实现五子棋游戏
10-18
【JavaScript实现五子棋游戏详解】 在网页上实现一款五子棋游戏，主要涉及的核心技术是HTML5的Canvas API和JavaScript编程。以下是对这个话题的详细解析： 1. **Canvas API**： Canvas是HTML5的一个重要特性，它...
JavaScript 五子棋(1)
志汉天涯~！~Day Day Up~
01-17 1047
<!-- #container {width:600px; height:800px; margin:0 auto; border:solid 0px blue; padding-top:7px; padding-left:6px} table {border-collapse:collapse; width:525px; height:525px} --
JavaScript游戏——五子棋
webbc的博客
11-01 2031
最近半个月一直在看深入的学习JavaScript，里面有很多重点和难点，比如闭包、词法分析、面向对象等。今天给大家分享一个由JavaScript编写的五子棋游戏，主要用到JavaScript的面向对象、事件委托、闭包等知识，还是挺有分量的，正好可以检测学习的成果。老规矩，先上图，再说话。
javascript实现五子棋
12-28
js 五子棋 ai js 五子棋 ai js 五子棋 ai js 五子棋 ai
js实现五子棋
12-11
使用javaScript语言实现五子棋，操作界面使用Html5实现。简单易懂。
JavaScript 五子棋人机大战
12-23
前端 JavaScript 五子棋人机大战，三子之前机器人下子随机，三子过后，机器人带有攻击性
Javascript实现五子棋
最新发布
希望我的博客，能帮上你解决学习中工作中所遇到的问题
11-03 99
Javascript实现五子棋
JavaScript五子棋简单
u010217654的博客
06-27 581
JavaScript五子棋简单demo html 代码 <body> <main class="gobang-box"> <h2>五子棋</h2> <div id="gobang" class="gobang"></div> <p id="orderHint" c...
JavaScript简单五子棋（canvas）
u010217654的博客
06-28 504
JS 简单五子棋 canvas 版本 前面有写过一个 JavaScript 通过DOM操作的版本 JS五子棋 html代码 <body> <div class="bg" id="bg"> <canvas id="myCanvas"></canvas> </div> </body> 画棋盘 /*...
JS之五子棋游戏
秀玉轩晨的博客
06-08 1124
JS代码var obox = document.getElementById("box"), arr = Array.apply(null,{length:20}), divWid = obox.offsetWidth / arr.length, oposi = obox.querySelector(".kuang .show"), pieces = obox.qu...
用js实现五子棋
安静的对折的专栏
01-11 867
思路： 1、先用canvas画五子棋的棋盘 2、获取鼠标点击的位置 3、根据鼠标点击的位置判断，并画棋子 4、根据下的棋子判断是否赢了 * { padding: 0; margin: 0; } canvas { margin: 10p
JavaScript五子棋小游戏
grass_root_boy的博客
04-27 322
&lt;!DOCTYPE html&gt;&lt;html&gt; &lt;head&gt; &lt;meta charset="UTF-8"&gt; &lt;title&gt;五子棋&lt;/title&gt; &lt;style type="text/css"&gt; h1{ width: 700px; height: 100p
JavaScript五子棋游戏实现详解
"JavaScript实现五子棋小游戏的代码实例" 在本文中，我们将探讨如何使用JavaScript来实现一个简单的五子棋小游戏。五子棋是一种双人对弈的策略型棋类游戏，目标是先将五个棋子连成一线的玩家获胜。下面我们将分析...
评论 1
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值