《php树的深度编历生成迷宫及a-自动寻路算法实例分析》由会员分享，可在线阅读，更多相关《php树的深度编历生成迷宫及a-自动寻路算法实例分析（15页珍藏版）》请在金锄头文库上搜索。
1、我真正系统地接触和学习党的基本知识是在这次中级党校的培训班上。通过学习，了解了党的发展历程，对党的性质、宗旨、任务等基本知识有了进一步的了解PHP树的深度编历生成迷宫及A*自动寻路算法实例分析这篇文章主要介绍了PHP树的深度编历生成迷宫及A*自动寻路算法,实例分析了php实现A*寻路算法的技巧,具有一定参考借鉴价值,需要的朋友可以参考下本文实例讲述了PHP树的深度编历生成迷宫及A*自动寻路算法。分享给大家供大家参考。具体分析如下：有一同事推荐了三思的迷宫算法，看了感觉还不错，就转成php三思的迷宫算法是采用树的深度遍历原理，这样生成的迷宫相当的细，而且死胡同数量相对较少！任意两点之间都存在唯一
2、的一条通路。至于A*寻路算法是最大众化的一全自动寻路算法废话不多说，贴上带代码迷宫生成类：代码如下:class Maze/ Maze Createprivate $_w;private $_h;private $_grids;private $_walkHistory;private $_walkHistory2;private $_targetSteps;/ Constructpublic function Maze() $this-_w = 6;$this-_h = 6;$this-_grids = array();/ 设置迷宫大小public function set($width =
3、6, $height = 6) if ( $width 0 ) $this-_w = $width;if ( $height 0 ) $this-_h = $height;return $this;/ 取到迷宫public function get() return $this-_grids;/ 生成迷宫public function create() $this-_init();return $this-_walk(rand(0, count($this-_grids) -1 );/ 获取死胡同点public function block($n = 0, $rand = false) $l
4、= count($this-_grids);for( $i = 1; $i $v = $this-_grids$i;if ( $v = 1 | $v = 2 | $v = 4 | $v = 8 ) $return = $i;/ 随机取点if ( $rand ) shuffle($return);if ( $n = 0 ) return $return;if ( $n = 1 ) return array_pop($return); else return array_slice($return, 0, $n);/*|-| 生成迷宫的系列函数|-*/private function _walk(
5、$startPos) $this-_walkHistory = array();$this-_walkHistory2 = array();$curPos = $startPos;while ($this-_getNext0() != -1) $curPos = $this-_step($curPos);if ( $curPos = false ) break;return $this;private function _getTargetSteps($curPos) $p = 0;$a = array();$p = $curPos - $this-_w;if ($p 0 & $this-_g
6、rids$p = 0 & ! $this-_isRepeating($p) array_push($a, $p); else array_push($a, -1);$p = $curPos + 1;if ($p % $this-_w != 0 & $this-_grids$p = 0 & ! $this-_isRepeating($p) array_push($a, $p); else array_push($a, -1);$p = $curPos + $this-_w;if ($p _grids) & $this-_grids$p = 0 & ! $this-_isRepeating($p)
7、 array_push($a, $p); else array_push($a, -1);$p = $curPos - 1;if ($curPos % $this-_w) != 0 & $this-_grids$p = 0 & ! $this-_isRepeating($p) array_push($a, $p); else array_push($a, -1);return $a;private function _noStep() $l = count($this-_targetSteps);for ($i = 0; $i if ($this-_targetSteps$i != -1) r
8、eturn false;return true;private function _step($curPos) $this-_targetSteps = $this-_getTargetSteps($curPos);if ( $this-_noStep() ) if ( count($this-_walkHistory) 0 ) $tmp = array_pop($this-_walkHistory); else return false;array_push($this-_walkHistory2, $tmp);return $this-_step($tmp);$r = rand(0, 3)
9、;while ( $this-_targetSteps$r = -1) $r = rand(0, 3);$nextPos = $this-_targetSteps$r;$isCross = false;if ( $this-_grids$nextPos != 0)$isCross = true;if ($r = 0) $this-_grids$curPos = 1;$this-_grids$nextPos = 4; elseif ($r = 1) $this-_grids$curPos = 2;$this-_grids$nextPos = 8; elseif ($r = 2) $this-_g
10、rids$curPos = 4;$this-_grids$nextPos = 1; elseif ($r = 3) $this-_grids$curPos = 8;$this-_grids$nextPos = 2;array_push($this-_walkHistory, $curPos);return $isCross ? false : $nextPos;private function _isRepeating($p) $l = count($this-_walkHistory);for ($i = 0; $i if ($this-_walkHistory$i = $p) return
11、 true;$l = count($this-_walkHistory2);for ($i = 0; $i if ($this-_walkHistory2$i = $p) return true;return false;private function _getNext0() $l = count($this-_grids);for ($i = 0; $i if ( $this-_grids$i = 0) return $i;return -1;private function _init() $this-_grids = array();for ($y = 0; $y _h; $y +)
12、for ($x = 0; $x _w; $x +) array_push($this-_grids, 0);return $this;A*寻路算法代码如下:class AStar/ A-starprivate $_open;private $_closed;private $_start;private $_end;private $_grids;private $_w;private $_h;/ Constructpublic function AStar()$this-_w = null;$this-_h = null;$this-_grids = null;public function set($width, $height, $grids) $this-_w = $width;$this-_h = $height;$this-_grids = $grids;return $this;/ 迷宫中寻路public function search($start = false, $end = false) return $this-_search($start, $end);/*|-
