第七周-自制迷宫升级版

我在原来的基础上加入了本学期的知识，从而能够让程序自动找到迷宫的正确道路。

/*Copyright (c) 2015,烟台大学计算机学院
 *All right reserved
*文件名称：ege.cpp
*作者：贾召飞
*完成日期：2015年10月16日
*版本号：v2.0
*本版本将解法加入了进去
*问题描述： 自制迷宫及自制图片
 */
#include<iostream.h>
#include"graphics.h"
  
  
  
//函数声明//   
void draw(void);  
void moveUp(void);  
void moveDown(void);  
void moveLeft(void);  
void moveRight(void);  
void change(void); 
void shengli(void);
void penguin(void);
void girl(void); 
void mgpath(int xi, int yi, int xe, int ye);

bool victory = false;
#define WIDTH 10   
#define LENGTH 20   
#define M 8
#define N 18
#define MaxSize 100
typedef struct
{
	int i;
	int j;
	int di;
}Box;
typedef struct
{
	Box data[MaxSize];
	int top;
}StType;
int map[WIDTH][LENGTH] =                                          //迷宫的地图
{  
    {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1},  
    {1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1},  
    {1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1},  
    {1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1},  
    {1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1},  
    {1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1},  
    {1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1},  
    {1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1},  
    {1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1},  
    {1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}  
};  
int heart[11][13] =                                               //心的数组
{
	{0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0},
	{0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0},
	{1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1},
	{1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1},
	{1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1},
	{0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0},
	{0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0},
	{0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0},
	{0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0},
	{0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0},
	{0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0}
};
int Pm[28][28] =                                                  //企鹅的输出
{
	{1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1},
	{1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1},
	{1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1},
	{1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1},
	{1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1},
	{1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1},
	{1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1},
	{1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1},
	{1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1},
	{1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1},
	{1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1},
	{1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1},
	{1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1},
	{1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1},
	{1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1},
	{1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1},
	{1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1},
	{1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1},
	{1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1},
	{1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1},
	{1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1},
	{1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1},
	{1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1},
	{1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1},
	{1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1},
	{1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1},
	{1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1},
	{1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1},
};
int Gm[1][6] = 
{
	{1, 2, 3, 4, 5, 6},
};
int x = 1;//初始x坐标   
int y = 1;//初始y坐标   
int xx = 0;  
int yy = 0;  

int main()
{
	
	initgraph(640,480); 
    char select;  
    setrendermode(RENDER_MANUAL);//防止刷图闪   
    draw();  
    setrendermode(RENDER_MANUAL);
	while(!victory)
	{
		select = getch();
        switch(select)  
        {    
        case 'w':  
            moveUp();  
            change();  
            setrendermode(RENDER_MANUAL);  
            cleardevice();   
            draw();  
            setrendermode(RENDER_MANUAL);   
            break;    
        case 's':  
            moveDown();  
            change();  
            setrendermode(RENDER_MANUAL);  
            cleardevice();   
            draw();              
			break;     
        case 'a':  
            moveLeft();  
            change();  
            setrendermode(RENDER_MANUAL);  
            cleardevice();   
            draw();  
            break;    
        case 'd':  
            moveRight();  
            change();  
            setrendermode(RENDER_MANUAL);  
            cleardevice();   
            draw();  
            break;
		case 'q':
			mgpath(1, 1, M, N);
			select = getch();
			setrendermode(RENDER_MANUAL);  
            cleardevice();
			draw();
			break;
		case 'z':
			victory = true;
			break;
		}
	}
    setrendermode(RENDER_MANUAL);  
    cleardevice();
	shengli();
	select = getch();
	closegraph();
	return 0;
}

void draw()                                                   //主界面的输出
{
	int i;
	int j;
	setfillstyle(1,RED);
	fillellipse(y*20+10, x*20+10, 10, 10);

	for (i = 0; i < 10; i++)
	{
		for (j = 0; j < 20; j++)
		{
			if (1 == map[i][j])
			{	
				setfillstyle(1,WHITE);
				bar((j+1)*20-20, (i+1)*20-20, (j+1)*20, (i+1)*20);
			}
			else if (i == 8 && j == 18)
			{
				setfillstyle(1,RED);
				bar((19)*20-20, (9)*20-20, (19)*20, (9)*20);
			}
		}
	}
}

void moveUp(void)
{
	if (map[x-1][y] != 1)
	{
		x = x - 1;
	}
	else 
	{
		return;
	}
}
 
void moveDown(void)
{
	if (map[x+1][y] != 1)
	{
		x = x + 1;
	}
	else 
	{
		x = x;
	}
}

void moveLeft(void)
{
	if (map[x][y-1] != 1)
	{
		y = y - 1;
	}
	else 
	{
		return;
	}
}
 
void moveRight(void)
{
	if (map[x][y+1] != 1)
	{
		y = y + 1;
	}
	else 
	{
		return;
	}
}

void change(void)
{
	if (x == 8 && y == 18)
	{
		victory = true;
	}
}

void shengli(void)
{
	int color;
	int i, j;
	for (i = 0; i < 11; i++)
	{
		for (j = 0; j < 13; j++)
		{
			if (1 == heart[i][j])
			{
				color = HSVtoRGB(randomf() * 360.0f, 1.0f, 0.8f);
				
				//setfillstyle(1,WHITE);
            			setfillcolor(color);
            			setcolor(color);
				bar((j+1)*20-20, (i+1)*20-20, (j+1)*20, (i+1)*20);
			}
		}
	}
}

void mgpath(int xi, int yi, int xe, int ye)
{
	int i, j, k, di, find;
	StType st;
	st.top = -1;
	st.top++;
	st.data[st.top].i = xi; st.data[st.top].j = yi;
	st.data[st.top].di = -1; map[xi][yi] = -1;
	while (st.top > -1)
	{
		i = st.data[st.top].i;
		j = st.data[st.top].j;
		di = st.data[st.top].di;
		if (i == xe && j == ye)
		{
			for (k = 0; k <= st.top; k++)
			{
				setfillstyle(1,GREEN);
				bar((st.data[k].j+1)*20-20, (st.data[k].i+1)*20-20, (st.data[k].j+1)*20, (st.data[k].i+1)*20);
			}
		}
		find = 0;
		while (di < 4 && find == 0)
		{
			di++;
			switch(di)
			{
			case 0: i = st.data[st.top].i-1; j = st.data[st.top].j; break;
			case 1: i = st.data[st.top].i; j = st.data[st.top].j+1; break;
			case 2: i = st.data[st.top].i+1; j = st.data[st.top].j; break;
			case 3: i = st.data[st.top].i; j = st.data[st.top].j-1; break;
			}
			if (map[i][j] == 0) find = 1;
		}
		if (find == 1)
		{
			st.data[st.top].di = di;
			st.top++;
			st.data[st.top].i = i; st.data[st.top].j = j;
			st.data[st.top].di = -1;
			map[i][j] = -1;
		}
		else
		{
			map[st.data[st.top].i][st.data[st.top].j] = 0;
			st.top--;
		}
	}
}

还加入了几个功能键

按下q可以看到正确道路

在按下任意键后可以消除提示

按下‘z’键后，会直接通关