int findgoal(int x,int y)
{
int i;
if(x == GOAL_X && y == GOAL_Y)
{
printf("Goal in!!\n");
printmaze();
return;
}
maze[y][x] = KITA;
for(i=x;maze[y][x+1] == AKI;i++)x=x+i;
for(i=y;maze[y+1][x] == AKI;i++)y=y+i;
for(i=x;maze[y][x-1] == AKI;i--)x=x+i;
for(i=y;maze[y-1][x] == AKI;i--)y=y+i;
printf("I can not find goal.\n");
maze[y][x] = AKI;
}
迷路の全ての経路探す関数ですが、これって再帰使わないで解けますか？