迷宫算法

Here is a simple implementation for maze issue.

<!--<br><br>Code highlighting produced by Actipro CodeHighlighter (freeware)<br>http://www.CodeHighlighter.com/<br><br>--> #include < stdio.h >
#include < stdlib.h >
#include < stdext.h >
#include < stdbool.h >
#define ROW_NUM8
#define COL_NUM8

typedef struct {
int x;
int y;
struct position * next;
}position;

static int maze[ROW_NUM][COL_NUM] = {{ 0 , 0 , 1 , 0 , 0 , 0 , 0 , 1 },
{ 1 , 1 , 0 , 1 , 1 , 0 , 1 , 0 },
{ 0 , 1 , 0 , 1 , 1 , 0 , 1 , 0 },
{ 0 , 1 , 0 , 1 , 0 , 1 , 0 , 1 },
{ 0 , 1 , 1 , 0 , 1 , 1 , 1 , 1 },
{ 0 , 0 , 0 , 1 , 1 , 0 , 0 , 1 },
{ 1 , 1 , 0 , 1 , 0 , 1 , 1 , 0 },
{ 0 , 0 , 1 , 0 , 1 , 1 , 0 , 0 }};

bool isvalid( int x, int y)
{
if (x >= 0 && x < ROW_NUM && y >= 0 && y < COL_NUM && maze[x][y] == 0 ) return true ;
return false ;
}

bool inpath( int x, int y,position * pos)
{
while (pos != NULL){
if (pos -> x == x && pos -> y == y) return true ;
pos = (position * )(pos -> next);
}
return false ;
}


static bool pathfound = false ;

void walkmaze( int x, int y,position * pos)
{
if (pathfound || ! isvalid(x,y) || inpath(x,y,pos)) return ;
if (x == ROW_NUM - 1 && y == COL_NUM - 1 ){
printf( " (%d,%d) " ,x,y);
while (pos != NULL){
printf( " <-(%d,%d) " ,pos -> x,pos -> y);
pos = (position * )pos -> next;
}
puts( "" );pathfound = true ; return ;
}
positionpos6;pos6.x = x,pos6.y = y;pos6.next = pos;walkmaze(x + 1 ,y + 1 , & pos6);
positionpos8;pos8.x = x,pos8.y = y;pos8.next = pos;walkmaze(x,y + 1 , & pos8);
positionpos5;pos5.x = x,pos5.y = y;pos5.next = pos;walkmaze(x + 1 ,y, & pos5);
positionpos1;pos1.x = x,pos1.y = y;pos1.next = pos;walkmaze(x - 1 ,y + 1 , & pos1);
positionpos2;pos2.x = x,pos2.y = y;pos2.next = pos;walkmaze(x - 1 ,y, & pos2);
positionpos4;pos4.x = x,pos4.y = y;pos4.next = pos;walkmaze(x + 1 ,y - 1 , & pos4);
positionpos7;pos7.x = x,pos7.y = y;pos7.next = pos;walkmaze(x,y - 1 , & pos7);
positionpos3;pos3.x = x,pos3.y = y;pos3.next = pos;walkmaze(x - 1 ,y - 1 , & pos3);
}

int main()
{
walkmaze( 0 , 0 ,NULL);
return 0 ;
}