Gobang native JavaScript sharing

osc_xsd7kks3 2020-11-09 12:58:28
gobang native javascript sharing


1.HTML part

<!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> gobang </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 part

var ScreenWidth = {

documentWidth: 500,
containerWidth: 400, // Default container width 
cellWidth: 20 // Cell width 
}
if (document.documentElement.clientWidth < 500) {

ScreenWidth.documentWidth = document.documentElement.clientWidth;
ScreenWidth.containerWidth = ScreenWidth.documentWidth * 0.8;
ScreenWidth.cellWidth = ScreenWidth.containerWidth * 0.05;
}
// Constant 
var reg = /\d{1,2}/g;
var white = []; // Let go of the white seeds 
var black = []; // Put the sunspot 
var tempKey = false; // Judge whether it is black or white 
var notOver = true; // Determine if the game is over 
var tips = " White go "; // Hint to go chess 
var count = 0;// The number of connections 
var bv = false; // Black wins 
var wv = false; // White wins 
var yCanWin = [];// An array stored in the same vertical element 
var xCanWin = [];// The array stored in the same horizontal element 
var xyCanWin = [];// The same positive oblique storage array 
var yxCanWin = [];// The same skew storage array 
// Use a timer to listen for victory 
var time = setInterval(function () {

if (bv) {

tips = " Black wins ";
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 = " White wins ";
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();// Start the game 
function newGame() {

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

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

document.getElementsByTagName("table")[i].remove();
}
}
// Initialize the following 
bgInit();
pieceInit();
spanFn();
white = [];
black = [];
tempKey = false;
notOver = true;
tips = " White go ";
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;
}
// Board initialization 
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]);
}
// Chess initialization 
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]);
}
// Go to chess 
for (var i = 0; i < document.getElementsByClassName("pieceBox").length; i++) {

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

if (tempKey) {

this.style.backgroundColor = "#000";// The spots 
tempKey = false;
black.push(this.className.match(reg));
victory(black, 0);// Judge whether black wins or not 
if (notOver) {

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

this.style.backgroundColor = "#fff";// An albino 
tempKey = true;
white.push(this.className.match(reg));
victory(white, 1);// Judge whether white wins or not 
if (notOver) {

tips = tipsGo(tempKey);
document.getElementsByTagName("span")[0].innerText = tips;
}
}
this.onclick = null;// Click after cancel click event 
}
}
// The hint is black or white 
function tipsGo(tempKey) {

if (tempKey) {

return " Go black ";
} else {

return " White go ";
}
}
/**
* Judge how to win
*x It stands for coordinate ,y Represents the ordinate
*1. Win , Namely x Same value , take y Values are sorted and compared
*2. Win , Namely y Same value , take x Values are sorted and compared
*3. It's a slanting win ,x+y The same value , take x or y Compare after sorting
*4. Anti skew wins ,x-y The same value , take x or y Compare after sorting
*/
function victory(target, c) {

if (target.length >= 5) {

// 1. Win 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]);// hold x The same values are put into the array yCanWin
}
}
yWin(yCanWin, c);
yCanWin = [];
}
// 2. Win 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]);// hold y The same values are put into the array xCanWin
}
}
xWin(xCanWin, c);
xCanWin = [];
}
// 3. It's a slanting win xyCanWin( From bottom left to top right )
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. Anti skew wins yxCanWin( From top left to bottom right )
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 = [];
}
}
}
// The vertical winning conditions of chess ( The positive and oblique winning conditions of chess )
function yWin(yCanWin, c) {
 // c = 0 For the black man c = 1 On behalf of Baizi 
var sortArray = [];// Sort array 
for (var i = 0; i < yCanWin.length; i++) {

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

return x - y;
});
// After array sorting , The first number is compared with the last number plus one ( Note the conversion of numeric types )
for (var j = 0; j < sortArray.length; j++) {

if (sortArray[j + 1]) {

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

count++; // Add one for each continuous , Clear one discontinuity 
if (count == 4 && c == 0) {

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

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

count = 0;
}
}
}
count = 0;
}
// The winning conditions of chess ( The anti skew winning condition of chess )
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;
}

It's not easy to write , Especially judging the conditions for a long time , Like and focus on , Thank you !

版权声明
本文为[osc_xsd7kks3]所创,转载请带上原文链接,感谢

  1. [front end -- JavaScript] knowledge point (IV) -- memory leakage in the project (I)
  2. This mechanism in JS
  3. Vue 3.0 source code learning 1 --- rendering process of components
  4. Learning the realization of canvas and simple drawing
  5. gin里获取http请求过来的参数
  6. vue3的新特性
  7. Get the parameters from HTTP request in gin
  8. New features of vue3
  9. vue-cli 引入腾讯地图(最新 api,rocketmq原理面试
  10. Vue 学习笔记(3,免费Java高级工程师学习资源
  11. Vue 学习笔记(2,Java编程视频教程
  12. Vue cli introduces Tencent maps (the latest API, rocketmq)
  13. Vue learning notes (3, free Java senior engineer learning resources)
  14. Vue learning notes (2, Java programming video tutorial)
  15. 【Vue】—props属性
  16. 【Vue】—创建组件
  17. [Vue] - props attribute
  18. [Vue] - create component
  19. 浅谈vue响应式原理及发布订阅模式和观察者模式
  20. On Vue responsive principle, publish subscribe mode and observer mode
  21. 浅谈vue响应式原理及发布订阅模式和观察者模式
  22. On Vue responsive principle, publish subscribe mode and observer mode
  23. Xiaobai can understand it. It only takes 4 steps to solve the problem of Vue keep alive cache component
  24. Publish, subscribe and observer of design patterns
  25. Summary of common content added in ES6 + (II)
  26. No.8 Vue element admin learning (III) vuex learning and login method analysis
  27. Write a mini webpack project construction tool
  28. Shopping cart (front-end static page preparation)
  29. Introduction to the fluent platform
  30. Webpack5 cache
  31. The difference between drop-down box select option and datalist
  32. CSS review (III)
  33. Node.js学习笔记【七】
  34. Node.js learning notes [VII]
  35. Vue Router根据后台数据加载不同的组件(思考-&gt;实现-&gt;不止于实现)
  36. Vue router loads different components according to background data (thinking - & gt; Implementation - & gt; (more than implementation)
  37. 【JQuery框架,Java编程教程视频下载
  38. [jQuery framework, Java programming tutorial video download
  39. Vue Router根据后台数据加载不同的组件(思考-&gt;实现-&gt;不止于实现)
  40. Vue router loads different components according to background data (thinking - & gt; Implementation - & gt; (more than implementation)
  41. 【Vue,阿里P8大佬亲自教你
  42. 【Vue基础知识总结 5,字节跳动算法工程师面试经验
  43. [Vue, Ali P8 teaches you personally
  44. [Vue basic knowledge summary 5. Interview experience of byte beating Algorithm Engineer
  45. 【问题记录】- 谷歌浏览器 Html生成PDF
  46. [problem record] - PDF generated by Google browser HTML
  47. 【问题记录】- 谷歌浏览器 Html生成PDF
  48. [problem record] - PDF generated by Google browser HTML
  49. 【JavaScript】查漏补缺 —数组中reduce()方法
  50. [JavaScript] leak checking and defect filling - reduce() method in array
  51. 【重识 HTML (3),350道Java面试真题分享
  52. 【重识 HTML (2),Java并发编程必会的多线程你竟然还不会
  53. 【重识 HTML (1),二本Java小菜鸟4面字节跳动被秒成渣渣
  54. [re recognize HTML (3) and share 350 real Java interview questions
  55. [re recognize HTML (2). Multithreading is a must for Java Concurrent Programming. How dare you not
  56. [re recognize HTML (1), two Java rookies' 4-sided bytes beat and become slag in seconds
  57. 【重识 HTML ,nginx面试题阿里
  58. 【重识 HTML (4),ELK原来这么简单
  59. [re recognize HTML, nginx interview questions]
  60. [re recognize HTML (4). Elk is so simple