Js随机迷宫算法

小提示

Ctrl+/代码提示(需IE11)
F11键放大 ESC键缩小
PgUp上页 PgDn下页

推荐代码

运行代码缩小

引入JS
- 3.0.0 2.2.0 2.1.4 2.1.3 2.1.2 2.1.1 2.1.0 2.0.3 2.0.2 2.0.1 2.0.0 1.12.0 1.11.3 1.11.2 1.11.1 1.11.0 1.10.2 1.10.1 1.10.0 1.9.1 1.9.0 1.8.3 1.8.2 1.8.1 1.8.0 1.7.2 1.7.1 1.7 1.6.4 1.6.2 1.6.1 1.4.4 1.4.3 1.4.2 1.4.1 1.4.0
- 1.7.3 1.7.2 1.7.1.0 1.7.0.0
- 2.0.0-beta.0 2.0.0-alpha.55 1.5.0-rc.0 1.4.8 1.4.0 1.3.20 1.2.29 1.1.5 1.0.8
- 1.8.3 1.7.0 1.6.0 1.5.2 1.4.4 1.3.3 1.2.4 1.1.7
- 1.10.4 1.9.7 1.8.10 1.7.8 1.6.3 1.5.4 1.4.6 1.3.3
- core1.6.0 core-compat1.6.0 core1.5.2 core-compat1.5.2 core-full-compat-yc1.4.5 core-full-compat1.4.5 core-full-nocompat-yc1.4.5 core-full-nocompat1.4.5
- 1.4.2 1.4.1 1.4.0 1.3.0 1.2.0 1.1.0
- 3.7.3 3.7.2 3.7.1 3.7.0 3.7 3.6.2 3.6.1 3.6

引入框架
- 1.4.5 1.4.4 1.4.3 1.4.2 1.4.1 1.4.0 1.3.2
- 1.11.4 1.11.3 1.11.2 1.11.1 1.11.0 1.10.4 1.10.3 1.10.2
- 3.3.6 3.3.5 3.3.0 3.2.0 2.3.2

汉王

HTML代码

复制格式化注释注释清空

放大

<html>
<head>
<title>Maze</title>
<style>
.maze_outer { position:absolute; left:20px; top:20px; }
.maze_inner { position:relative; }
.maze_cell { position:absolute; width:16px; height:16px; overflow:hidden; border:1px solid black; }
</style>
<script>
window.onload = init;
function init(){
	var mz = new Maze();
	mz.create();
	document.body.appendChild(mz.toHTMLObject());
}
function Maze(){
	this.size = [40,40];
	this.inited = false;
	this.init = function(){
		this.nodes = [];
		for (var y=0; y<this.size[1]; y++){
			this.nodes[y] = [];
			for (var x=0; x<this.size[0]; x++){
				this.nodes[y][x] = new Node(this, x, y);
			}
		}
		this.inited = true;
	}
	
	this.get_node = function(x,y){
		return this.inited && x >=0 && x < this.size[0] && y >= 0 && y < this.size[1] && this.nodes[y][x];
	}
	
	this.create = function(){
		if (!this.inited) this.init();
		var try_count = 0;
		var points = [];
		var most_rightbottom_point = this.nodes[0][0];
		//var max_p_len = 0;
		var cp;
		points.push(this.nodes[0][0]);
		
		while(points.length > 0){
			var np = random_init_cell(cp = points.pop());
			if (cp.x >= most_rightbottom_point.x && cp.y >= most_rightbottom_point.y) most_rightbottom_point = cp;
			for (var i=0; i<np.length; i++) points.unshift(np[i]);
			//if (max_p_len < points.length) max_p_len = points.length;
			if (points.length == 0 && !this.nodes[this.size[1]-1][this.size[0]-1].inited && ++try_count < 1000){
				most_rightbottom_point.inited = false;
				points.push(most_rightbottom_point);
				
			}
		}
		
		//alert("最大并发路径数：" + max_p_len+"\r\n尝试次数："+try_count);
		
		function random_init_cell(p){
			if (p.inited) return [];
			var re = [];
			for (var i=0, dir; i<Maze.DIR.length && (dir = Maze.DIR[i]); i++){
				if (p[dir]() && !p.dir[dir] && Math.random() < ratio(dir, p)){
					p.open(dir);
					re.push(p[dir]());
				}
			}
			p.inited = true;
			return re;
			
		}
		
		function ratio(dir, p){
			var c = p.branches_count()*0.5 + p[dir]().branches_count() * 10;
			return Math.pow(0.4,c);
		}
	}
	
	this.toHTMLObject = function (){
		var obj_outer = document.createElement("div");
		obj_outer.className = "maze_outer";
		var obj_inner = document.createElement("div");
		obj_inner.className = "maze_inner";
		obj_outer.appendChild(obj_inner);
		
		if (!this.inited) this.init();
		
		for (var y=0; y<this.size[1]; y++){
			for (var x=0; x<this.size[0]; x++){
				var nd = document.createElement("div");
				nd.className = "maze_cell";
				nd.x = x; nd.y = y;
				nd.style.left = x * 15 + "px";
				nd.style.top = y * 15 + "px";
				for (var i in this.nodes[y][x].dir){
					if (this.nodes[y][x].dir[i]) nd.style["border" + i.charAt(0).toUpperCase() + i.substring(1)] = "1px solid white";
				}
				obj_inner.appendChild(nd);
			}
		}
		return obj_outer;
	}
}
Maze.DIR = ["top", "left", "bottom", "right"];
function Node(maze, x, y){
	this.maze = maze;
	this.x = x || 0;
	this.y = y || 0;
	this.dir = {};
	this.inited = false;
	this.left = function(){ return this.maze.get_node(x-1, y); }
	this.right = function(){ return this.maze.get_node(x+1, y); }
	this.top = function(){ return this.maze.get_node(x, y-1); }
	this.bottom = function(){ return this.maze.get_node(x, y+1); }
	this.open = function(d){
		if (d == "top"){
			this.dir.top = this.top().dir.bottom = true;
		}else if (d == "right"){
			this.dir.right = this.right().dir.left = true;
		}else if (d == "bottom"){
			this.dir.bottom = this.bottom().dir.top = true;
		}else if (d == "left"){
			this.dir.left = this.left().dir.right = true;
			
		}
	}
	this.branches_count = function(){
		var re = 0;
		for (var i in this.dir) if (this.dir[i]) re++;
		return re;
	}
}
</script>
</head>
<body></body>
</html>

CSS代码

复制格式化注释注释颜色清空

放大

JS代码

复制格式化注释注释清空

放大

运行代码

简介

请输入代码名称！

名称

Js随机迷宫算法

分类

网站常用

描述

JavaScript随机迷宫算法，开始还以为是一张图片，看了代码才知道，原来是用Js生成的，闲暇时候写的，大家共同学习，希望对你有帮助。