미로찾기 (재귀함수를 이용한 방법)

소개

해당 소스는 2차원 배열로 선언된 미로를 이용하여 출발점에서 도착점 까지의 길을 재귀 함수를 이용해서 찾는 소스 입니다. 자료구조 과목의 스텍을 이용한 방법이 아니라, 재귀함수로써 구하게 되기 때문에 혹시나 스텍으로 하신걸 구하시는 분은 ^^ 다른 자료를 찾아보세요 ~~ ㅎ

컴파일 실행환경

Microsoft Visual C++ 6

본문내용

// ----------------------------------------------------- //
#define width 25
// 지도배열의 가로 크기
#define height 16
// 지도 배열의 세로 크기
#define StartX 1
// 시작지점 X 좌표
#define StartY 1
// 시작지점 Y 좌표
#define FinishX 23
// 도착 지점 X 좌표
#define FinishY 14
// 도착지점 Y 좌표
// ----------------------------------------------------- //
int maze[16][25] = {
{2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2},
{2,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,2},
{2,2,2,0,2,2,2,2,2,0,2,0,2,2,2,2,2,2,2,2,2,2,0,2,2},
{2,2,2,0,2,0,0,0,2,0,2,0,2,0,0,0,0,0,0,0,0,2,0,0,2},
{2,0,0,0,2,0,2,0,2,0,2,0,2,0,2,2,2,2,2,2,0,2,2,0,2},
{2,0,2,0,2,2,2,0,2,2,2,0,2,0,2,0,0,0,0,0,0,2,2,0,2},
{2,0,2,0,0,0,0,0,0,0,2,0,2,0,2,2,2,2,0,2,0,0,0,0,2},
{2,0,2,2,2,2,2,2,2,0,2,0,2,0,0,0,0,2,0,2,2,2,2,2,2},
{2,0,0,0,0,0,0,2,2,0,2,0,2,2,2,2,0,2,0,2,0,0,0,0,2},
{2,2,2,2,2,2,0,2,2,0,2,0,0,0,0,2,0,2,2,2,0,2,0,2,2},
{2,0,0,0,0,2,0,2,2,0,2,0,2,2,0,2,0,2,2,2,0,2,0,2,2},
{2,0,2,2,0,2,0,2,2,0,2,0,2,2,0,2,0,0,0,0,0,2,0,2,2},
{2,0,2,2,0,2,0,2,2,0,2,0,2,2,0,2,0,2,2,2,2,2,0,0,2},
{2,0,2,2,2,2,0,2,2,0,0,0,2,2,0,2,0,2,2,2,2,2,2,2,2},
{2,0,0,0,0,0,0,2,2,2,2,2,0,0,0,2,0,0,0,0,0,0,0,0,2},
{2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2}
};

void ShowMaze(int arr[height][width]); // 미로를 보여주는데 사용
int visit(int i, int j); // 미로의 방문하는 함수


.... 이하 생략

참고자료

· 없음