回溯走迷宫

#include<iostream>
#include<windows.h>  
using namespace std;
int tap[100] = {0}, n;
int map[10][10] = {
{ 1,1,1,1,1,1,1,1,1,1 },
{ 1,0,0,0,0,0,0,0,0,1 },
{ 1,0,1,1,1,0,1,1,0,1 },
{ 1,0,0,0,1,0,1,1,0,1 },
{ 1,0,1,1,1,0,0,1,0,1 },
{ 1,0,0,0,0,1,0,0,0,1 },
{ 1,0,1,0,1,1,1,0,0,1 },
{ 1,0,1,0,0,1,0,1,0,1 },
{ 1,0,0,1,0,0,0,0,0,1 },
{ 1,1,1,1,1,1,1,1,1,1 }
};
struct Dir
{
int x;
int y;
};
Dir dir[4] = { {0,1},{1,0},{0,-1}, {-1,0} };
void flash()
{
system("cls");
for (int i = 0; i < 10; i++)
{
for (int j = 0; j < 10; j++)
{
if (i == 9 && j == 8)
{
cout << "出";
}
else if (map[i][j] == -1)
{
cout << "走";
}
else if (map[i][j] == 1)
{
cout << "■";
}
else if (map[i][j] == 0)
{
cout << "  ";
}
}
cout << endl;
}
}
void check(int i,int j,int top)
 {
if (map[i][j] == 0)
{
map[i][j] = -1;
flash();
Sleep(500);
for (int d = 0; d < 4; d++)
{
if (i == 8 && j == 8)
{
tap[n] = top + 1;
n++;
continue;
}
check(i + dir[d].x, j + dir[d].y, top + 1);

}
     map[i][j] = 0;
flash();
Sleep(500);
}
}
int main()
{
int min = 100;
flash();
check(1, 1, 0);
for (int i = 0; i < n; i++)
{
if (tap[i] < min)
min = tap[i];
}
cout << "最短路径" <<min<< endl;
return 0;
}