maze.cpp

DOS下的 小迷宫 源代码。。功能比较简单

// maze.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include "heap.h"
#include <iostream.h>
int main(int argc, char* argv[])
{
    int Array[10][10]={
        {0,0,0,0,0,0,0,0,0,0},
        {0,1,1,0,0,0,0,0,0,0},
        {0,0,1,1,0,0,0,1,0,0},
        {0,0,0,1,1,1,1,1,0,0},
        {0,0,0,1,0,0,0,0,0,0},
        {0,0,0,1,0,0,0,0,0,0},
        {0,0,0,1,1,1,0,0,0,0},
        {0,0,0,0,0,1,0,0,0,0},
        {0,0,0,0,0,1,0,0,0,0},
        {0,0,0,0,0,0,0,0,0,0}};
        
        for(int i=0;i<=9;i++)
        {
            printf("\n");
            for(int j=0;j<=9;j++)
            {
                if(Array[i][j]==1)
                {
                    printf("   ");
                }
                else
                {
                    printf(" * ");
                }
                
            }
        }
        cout << endl;
        system("cls");
        
        CHeap heap;
        Node node;
        
        while(node.a!=8||node.b!=5)
        {
            
            node.checkroad(Array);
            if(node.GetSum()>=2)
            {
                if(node.up == 1)
                {
                    node.uproad(Array);
                    node.up =0;
                    node.a++;
                    heap.push(node);
                    node.a--;
                    continue;
                }
                if(node.right == 1)
                {
                    node.rightroad(Array);
                    node.right = 0;
                    node.b--;
                    heap.push(node);
                    node.b++;
                    continue;
                }
                if(node.down == 1)
                {
                    node.downroad(Array);
                    node.down =0;
                    node.a--;
                    heap.push(node);
                    node.a++;
                    continue;
                }
                if(node.left == 1)
                {
                    node.leftroad(Array);
                    node.left = 0;
                    node.b++;
                    heap.push(node);
                    node.b--;
                    continue;
                }
                
                
                
            }
            if(node.GetSum()==0)
            {
                heap.pop(node);
            }
            if(node.up == 1)
            {
                node.uproad(Array);
                node.down =0;
                continue;
            }
            if(node.right == 1)
            {
                node.rightroad(Array);
                node.left = 0;
                continue;
            }
            if(node.down == 1)
            {
                node.downroad(Array);
                node.up =0;
                continue;
            }
            if(node.left == 1)
            {
                node.leftroad(Array);
                node.right = 0;
                continue;
            }
            
        }
        if(node.a ==8 && node.b ==5)
        {
            cout << endl;
            cout << "走出迷宫" << endl;
        }
        
        return 0;
}