利用PHP实现开心消消乐的算法示例

  'red',2 => 'green',3 => 'yellow',4 => 'blue',5 => 'black');//代表5种颜色 $samCol = array();//列上相连色块集合 $nowCol = array();//列上相连色块指针 $samArr = array();//相连色块总集合 $group = 1;//组指针 //随机填充颜色，并获得行上相连色块start foreach($xxl as $k1 => <em style="color:transparent">来源[email protected]搞@^&代*@码网</em>$v1){ $sam = array();//行上相连色块集合 $now = 1;//行上相连色块指针 foreach($v1 as $k2 => $v2){ if(empty($v2) || $v2 == ' '){ $v2 = $xxl[$k1][$k2] = array_rand($color);//随机填充颜色 } if(!isset($nowCol[$k2])){ $nowCol[$k2] = 1; } if($k1 === 0){ $samCol[$k2][$nowCol[$k2]][$k1 .'-'. $k2] = array($k1, $k2, $v2, $k1 .'-'. $k2 .'-'. $v2); }else{ if($v2 != $xxl[$k1-1][$k2]){//同一列上和前一个颜色不一样 $nowCol[$k2] ++; } $samCol[$k2][$nowCol[$k2]][$k1 .'-'. $k2] = array($k1, $k2, $v2, $k1 .'-'. $k2 .'-'. $v2); } if($k2 === 0){ $sam[$now][$k1 .'-'. $k2] = array($k1, $k2, $v2, $k1 .'-'. $k2 .'-'. $v2); }else{ if($v2 != $xxl[$k1][$k2-1]){//同一行上和前一个颜色不一样 $now++; } $sam[$now][$k1 .'-'. $k2] = array($k1, $k2, $v2, $k1 .'-'. $k2 .'-'. $v2); } } //获得行上相连色块start foreach($sam as $x => $y){ if(count($y) > 2){ $key = 'R-'.$group; foreach($y as $x2 => $y2){ $y[$x2]['group']['r'] = $key; } $samArr += $y; $group ++; } } //获得行上相连色块end } //随机填充颜色，并获得行上相连色块end //获得列上相连色块start $group = 1; foreach($samCol as $k => $v){ foreach($v as $x => $y){ if(count($y) > 2){ $key = 'L-'.$group; foreach($y as $x2 => $y2){ $y[$x2]['group']['l'] = $key; if(isset($samArr[$x2]['group']['r'])){//判断本点是否已出现在横向组里 $samArr[$x2]['group']['l'] = $key; } } $samArr += $y; $group ++; } } } //获得列上相连色块end //查找相连色块start $res = array();//相连色块集合 $hasRes = array(); foreach($samArr as $k => $v){ if(isset($hasRes[$k])){ continue; } $arr = array(); seek($samArr, $v, $arr); $res[] = array_keys($arr); $hasRes += $arr; } //查找相连色块end show($xxl);//打印消除前的图形 if(empty($res)){//如果没有相连色块则退出递归 echo '=================================消除完毕！=================================='; return $point; } $thisPoint = countPoint($res);//计算本次消除获得积分 $point += $thisPoint;//累计到总积分 //消除相连色块start $next = $xxl; foreach($res as $k => $v){ foreach($v as $k2 => $v2){ $y = $samArr[$v2][0]; $x = $samArr[$v2][1]; $xxl[$y][$x] = '*'; unset($next[$y][$x]); } } //消除相连色块end show($xxl);//打印消除时的图形 $next = step($next); show($next);//打印消除后的图形 echo "本次消除获得积分数量：{$thisPoint}\n"; return play($next, $point); } /*计算获得积分数量 *$xxl  array 相连色块集合 */ function countPoint($xxl){ //初始化积分配置start $config = array(3 => 10, 4 => 15, 5 => 20, 6 => 30, 7 => 40, 8 => 70, 9 => 100); for($i = 10; $i  $v){ $temp = array_merge($v); $count = count($temp); if($count == 8){ continue; } for($i = $count; $i  $v){ foreach($v as $k2 => $v2){ $arr[7-$k2][$k] = $v2; } } ksort($arr); //顺时针旋转矩阵end $str = ''; foreach($arr as $v){ foreach($v as $v2){ $str .= ' '.$v2; } $str .= "\n"; } echo "\n".$str; }

 =================================开始第1步================================== 3 3 2 2 1 1 1 4 4 3 4 3 4 1 1 3 3 1 4 1 1 4 1 2 2 3 4 3 1 2 4 4 4 2 4 2 2 2 1 4 3 3 2 1 2 3 1 1 5 2 1 3 2 1 4 5 3 4 5 1 3 2 3 3 3 3 2 2 * * * 4 4 3 * 3 4 1 * 3 3 1 * 1 1 4 * 2 2 3 * 3 1 2 4 4 4 2 * * * * 1 4 3 3 2 1 * 3 1 1 5 2 1 3 * 1 4 5 3 4 5 1 3 2 3 3 3 3   4 4 3 2  3 3 1 3 1 2 2 3 1 4 4 4 4 2 2 3 4 2 1 4 3 3 2 1 1 3 1 1 5 2 1 3 1 1 4 5 3 4 5 1 3 2 3 3 本次消除获得积分数量：55 =================================开始第2步================================== 3 3 2 2 3 3 2 4 4 3 3 2 1 3 3 3 3 1 3 3 4 1 4 2 2 3 5 1 2 4 4 4 4 2 2 3 4 2 1 4 3 3 2 1 1 3 1 1 5 2 1 3 1 1 4 5 3 4 5 1 3 2 3 3 3 3 2 2 3 3 2 4 4 3 3 2 1 * * * 3 1 3 3 4 1 4 2 2 3 5 1 2 * * * 4 2 2 3 4 2 1 4 3 3 2 1 1 3 1 1 5 2 1 3 1 1 4 5 3 4 5 1 3 2 3 3 3 3 2 2 3 4 3 3 2 1 3 1 3 3 4 3 2 4 2 3 5 1 2 1 4 2 4 2 2 3 4 2 1 4 3 3 2 1 1 3 1 1 5 2 1 3 1 1 4 5 3 4 5 1 3 2 3 3 本次消除获得积分数量：20 =================================开始第3步================================== 3 3 2 2 3 4 1 3 4 3 3 2 1 4 2 5 3 1 3 3 4 3 2 4 2 3 5 1 2 1 4 2 4 2 2 3 4 2 1 4 3 3 2 1 1 3 1 1 5 2 1 3 1 1 4 5 3 4 5 1 3 2 3 3 =================================消除完毕！================================== 共获得积分数量：75