五子棋原生JavaScript分享

osc_xsd7kks3 2020-11-09 12:58:28
javascript


1.HTML部分

<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, height=device-height, initial-scale=1.0, user-scalable=no">
<title>五子棋</title>
<style>
* {

margin: 0px;
padding: 0px;
}
.box {

border-spacing: 0px;
border: 1px solid #3c3c3c;
background-color: #e1e1e2;
margin: auto;
}
.piece {

border-spacing: 0px;
border: 1px solid;
}
</style>
</head>
<body>
<script type="text/javascript" src="./Gobang.js"></script>
</body>
</html>

2.JavaScript部分

var ScreenWidth = {

documentWidth: 500,
containerWidth: 400, // 容器默认宽度
cellWidth: 20 // 单元格宽度
}
if (document.documentElement.clientWidth < 500) {

ScreenWidth.documentWidth = document.documentElement.clientWidth;
ScreenWidth.containerWidth = ScreenWidth.documentWidth * 0.8;
ScreenWidth.cellWidth = ScreenWidth.containerWidth * 0.05;
}
//常量
var reg = /\d{1,2}/g;
var white = []; // 放白子
var black = []; // 放黑子
var tempKey = false; // 判断是走黑子还是白子
var notOver = true; // 判断游戏是否结束
var tips = "白棋走"; // 提示走棋
var count = 0;//相连的个数
var bv = false; // 黑棋胜利
var wv = false; // 白棋胜利 
var yCanWin = [];// 同一竖元素存放的数组
var xCanWin = [];// 同一横元素存放的数组
var xyCanWin = [];// 同一正斜存放的数组
var yxCanWin = [];// 同一反斜存放的数组
// 用计时器监听是否胜利
var time = setInterval(function () {

if (bv) {

tips = "黑棋胜利";
document.getElementsByTagName("span")[0].innerText = tips;
for (var i = 0; i < document.getElementsByClassName("pieceBox").length; i++) {

document.getElementsByClassName("pieceBox")[i].onclick = null;
}
clearInterval(time);
}
if (wv) {

tips = "白棋胜利";
document.getElementsByTagName("span")[0].innerText = tips;
for (var i = 0; i < document.getElementsByClassName("pieceBox").length; i++) {

document.getElementsByClassName("pieceBox")[i].onclick = null;
}
clearInterval(time);
}
}, 100);
newGame();// 开始游戏
function newGame() {

if (document.getElementsByTagName("table").length) {

for (var i = 0; i < document.getElementsByTagName("table").length; i++) {

document.getElementsByTagName("table")[i].remove();
}
}
// 初始化以下内容
bgInit();
pieceInit();
spanFn();
white = [];
black = [];
tempKey = false;
notOver = true;
tips = "白棋走";
count = 0;
bv = false;
xCanWin = [];
yCanWin = [];
xyCanWin = [];
yxCanWin = [];
}
function spanFn() {

var span = document.createElement("span");
document.body.insertBefore(span, document.getElementsByTagName("script")[0]);
span.innerText = tips;
}
// 棋盘初始化
function bgInit() {

var table = document.createElement("table");
table.className = "box"
for (var y = 0; y < 20; y++) {

var tr = document.createElement("tr");
for (var x = 0; x < 20; x++) {

var td = "<td class='box-" + y + "-" + x + "' style='width: " + ScreenWidth.cellWidth + "px; height: " + ScreenWidth.cellWidth + "px;border:1px solid #9c9c9c'></td>";
tr.innerHTML += td;
}
table.appendChild(tr);
}
document.body.insertBefore(table, document.getElementsByTagName("script")[0]);
}
// 棋子初始化
function pieceInit() {

var table = document.createElement("table");
table.className = "piece"
table.style = "position: absolute; top: 0; left:50%; margin-left:-" + (ScreenWidth.containerWidth + 42) / 2 + "px";
for (var y = 0; y < 20; y++) {

var tr = document.createElement("tr");
for (var x = 0; x < 20; x++) {

var td = "<td class='piece-" + y + "-" + x + " pieceBox' style='width: " + ScreenWidth.cellWidth + "px; height: " + ScreenWidth.cellWidth + "px;border:1px solid transparent;border-radius: 50%;'></td>";
tr.innerHTML += td;
}
table.appendChild(tr);
}
document.body.insertBefore(table, document.getElementsByTagName("script")[0]);
}
// 走棋
for (var i = 0; i < document.getElementsByClassName("pieceBox").length; i++) {

document.getElementsByClassName("pieceBox")[i].onclick = function () {

if (tempKey) {

this.style.backgroundColor = "#000";// 黑子
tempKey = false;
black.push(this.className.match(reg));
victory(black, 0);//判断黑棋胜利与否
if (notOver) {

tips = tipsGo(tempKey);
document.getElementsByTagName("span")[0].innerText = tips;
}
} else {

this.style.backgroundColor = "#fff";// 白子
tempKey = true;
white.push(this.className.match(reg));
victory(white, 1);//判断白棋胜利与否
if (notOver) {

tips = tipsGo(tempKey);
document.getElementsByTagName("span")[0].innerText = tips;
}
}
this.onclick = null;// 点击之后取消点击事件
}
}
// 提示走黑还是走白
function tipsGo(tempKey) {

if (tempKey) {

return "黑棋走";
} else {

return "白棋走";
}
}
/**
*判断各种赢的方式
*x代表很坐标,y代表纵坐标
*1.竖赢,就是x值相同,取y值排序后比较
*2.横赢,就是y值相同,取x值排序后比较
*3.正斜赢,x+y相同的值,取x或y排序后比较
*4.反斜赢,x-y相同的值,取x或y排序后比较
*/
function victory(target, c) {

if (target.length >= 5) {

// 1.竖赢yCanWin
for (var i = 0; i < target.length; i++) {

for (var j = 0; j < target.length; j++) {

if (target[j][1] == target[i][1]) {

yCanWin.push(target[j]);//把x相同的值放入数组yCanWin
}
}
yWin(yCanWin, c);
yCanWin = [];
}
// 2.横赢xCanWin
for (var m = 0; m < target.length; m++) {

for (var n = 0; n < target.length; n++) {

if (target[n][0] == target[m][0]) {

xCanWin.push(target[n]);//把y相同的值放入数组xCanWin
}
}
xWin(xCanWin, c);
xCanWin = [];
}
// 3.正斜赢xyCanWin(左下到右上)
for (var a = 0; a < target.length; a++) {

for (var b = 0; b < target.length; b++) {

if (parseInt(target[b][0]) + parseInt(target[b][1]) == parseInt(target[a][0]) + parseInt(target[a][1])) {

xyCanWin.push(target[b])
}
}
yWin(xyCanWin, c);
xyCanWin = [];
}
// 4.反斜赢yxCanWin(左上到右下)
for (var v = 0; v < target.length; v++) {

for (var w = 0; w < target.length; w++) {

if (parseInt(target[w][0]) - parseInt(target[w][1]) == parseInt(target[v][0]) - parseInt(target[v][1])) {

yxCanWin.push(target[w])
}
}
xWin(yxCanWin, c);
yxCanWin = [];
}
}
}
// 棋的竖赢条件(棋的正斜赢条件)
function yWin(yCanWin, c) {
 // c = 0代表黑子 c = 1代表白子
var sortArray = [];//排序数组 
for (var i = 0; i < yCanWin.length; i++) {

sortArray.push(yCanWin[i][0]);
}
sortArray.sort(function (x, y) {

return x - y;
});
// 数组排序后,前数和后数加一相比(注意数值类型的转换)
for (var j = 0; j < sortArray.length; j++) {

if (sortArray[j + 1]) {

if (parseInt(sortArray[j]) + 1 == parseInt(sortArray[j + 1])) {

count++; // 每有一个连续则加一,一次不连续就清零
if (count == 4 && c == 0) {

bv = true;
notOver = false;// 游戏结束
return;
} else if (count == 4 && c == 1) {

wv = true;
notOver = false;
return;
}
} else {

count = 0;
}
}
}
count = 0;
}
// 棋的横赢条件(棋的反斜赢条件)
function xWin(xCanWin, c) {

var sortArray = [];
for (var i = 0; i < xCanWin.length; i++) {

sortArray.push(xCanWin[i][1]);
}
sortArray.sort(function (x, y) {

return x - y;
});
for (var j = 0; j < sortArray.length; j++) {

if (sortArray[j + 1]) {

if (parseInt(sortArray[j]) + 1 == parseInt(sortArray[j + 1])) {

count++;
if (count == 4 && c == 0) {

bv = true;
notOver = false;
return;
} else if (count == 4 && c == 1) {

wv = true;
notOver = false;
return;
}
} else {

count = 0;
}
}
}
count = 0;
}

编写不易,尤其是判断条件想了好一会,点赞关注,谢谢老爷们!

版权声明
本文为[osc_xsd7kks3]所创,转载请带上原文链接,感谢
https://my.oschina.net/u/4341499/blog/4709407

  1. 【计算机网络 12(1),尚学堂马士兵Java视频教程
  2. 【程序猿历程,史上最全的Java面试题集锦在这里
  3. 【程序猿历程(1),Javaweb视频教程百度云
  4. Notes on MySQL 45 lectures (1-7)
  5. [computer network 12 (1), Shang Xuetang Ma soldier java video tutorial
  6. The most complete collection of Java interview questions in history is here
  7. [process of program ape (1), JavaWeb video tutorial, baidu cloud
  8. Notes on MySQL 45 lectures (1-7)
  9. 精进 Spring Boot 03:Spring Boot 的配置文件和配置管理,以及用三种方式读取配置文件
  10. Refined spring boot 03: spring boot configuration files and configuration management, and reading configuration files in three ways
  11. 精进 Spring Boot 03:Spring Boot 的配置文件和配置管理,以及用三种方式读取配置文件
  12. Refined spring boot 03: spring boot configuration files and configuration management, and reading configuration files in three ways
  13. 【递归,Java传智播客笔记
  14. [recursion, Java intelligence podcast notes
  15. [adhere to painting for 386 days] the beginning of spring of 24 solar terms
  16. K8S系列第八篇(Service、EndPoints以及高可用kubeadm部署)
  17. K8s Series Part 8 (service, endpoints and high availability kubeadm deployment)
  18. 【重识 HTML (3),350道Java面试真题分享
  19. 【重识 HTML (2),Java并发编程必会的多线程你竟然还不会
  20. 【重识 HTML (1),二本Java小菜鸟4面字节跳动被秒成渣渣
  21. [re recognize HTML (3) and share 350 real Java interview questions
  22. [re recognize HTML (2). Multithreading is a must for Java Concurrent Programming. How dare you not
  23. [re recognize HTML (1), two Java rookies' 4-sided bytes beat and become slag in seconds
  24. 造轮子系列之RPC 1:如何从零开始开发RPC框架
  25. RPC 1: how to develop RPC framework from scratch
  26. 造轮子系列之RPC 1:如何从零开始开发RPC框架
  27. RPC 1: how to develop RPC framework from scratch
  28. 一次性捋清楚吧,对乱糟糟的,Spring事务扩展机制
  29. 一文彻底弄懂如何选择抽象类还是接口,连续四年百度Java岗必问面试题
  30. Redis常用命令
  31. 一双拖鞋引发的血案,狂神说Java系列笔记
  32. 一、mysql基础安装
  33. 一位程序员的独白:尽管我一生坎坷,Java框架面试基础
  34. Clear it all at once. For the messy, spring transaction extension mechanism
  35. A thorough understanding of how to choose abstract classes or interfaces, baidu Java post must ask interview questions for four consecutive years
  36. Redis common commands
  37. A pair of slippers triggered the murder, crazy God said java series notes
  38. 1、 MySQL basic installation
  39. Monologue of a programmer: despite my ups and downs in my life, Java framework is the foundation of interview
  40. 【大厂面试】三面三问Spring循环依赖,请一定要把这篇看完(建议收藏)
  41. 一线互联网企业中,springboot入门项目
  42. 一篇文带你入门SSM框架Spring开发,帮你快速拿Offer
  43. 【面试资料】Java全集、微服务、大数据、数据结构与算法、机器学习知识最全总结,283页pdf
  44. 【leetcode刷题】24.数组中重复的数字——Java版
  45. 【leetcode刷题】23.对称二叉树——Java版
  46. 【leetcode刷题】22.二叉树的中序遍历——Java版
  47. 【leetcode刷题】21.三数之和——Java版
  48. 【leetcode刷题】20.最长回文子串——Java版
  49. 【leetcode刷题】19.回文链表——Java版
  50. 【leetcode刷题】18.反转链表——Java版
  51. 【leetcode刷题】17.相交链表——Java&python版
  52. 【leetcode刷题】16.环形链表——Java版
  53. 【leetcode刷题】15.汉明距离——Java版
  54. 【leetcode刷题】14.找到所有数组中消失的数字——Java版
  55. 【leetcode刷题】13.比特位计数——Java版
  56. oracle控制用户权限命令
  57. 三年Java开发,继阿里,鲁班二期Java架构师
  58. Oracle必须要启动的服务
  59. 万字长文!深入剖析HashMap,Java基础笔试题大全带答案
  60. 一问Kafka就心慌?我却凭着这份,图灵学院vip课程百度云