数字迷宫

最新推荐文章于 2024-04-06 20:26:46 发布
最新推荐文章于 2024-04-06 20:26:46 发布
阅读量1.1k 收藏 2
点赞数
分类专栏： LAN7的神奇东西
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/LAN74__/article/details/74970407
版权

这几天写这个数字迷宫真的不容易。。。。。找bug时间有点长。。。。完善了几个模式，挺好玩的

#include <stdio.h>
#include <string.h>
#include <conio.h>
#include <windows.h>
#include <iostream>
#include <time.h>
#include <dos.h>
using namespace std;
void main_show(){
    cout << endl << endl << endl << endl << endl;
    printf("\t\t\t\t欢迎来到数字迷宫\n"); 
    printf("\t\t\t\t  1:经典迷宫\n");
    printf("\t\t\t\t  2:绝命逃亡\n");
    printf("\t\t\t\t  3:  PVP\n");
    printf("\t\t\t\t  4:  PVE\n");
    printf("\t\t\t\t  5:查看规则\n");
    printf("\t\t\t\t  6:退出游戏\n");

}
/***********************************************
                   game函数 
************************************************/
int map[17][24] = {0,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,0,0,0,0,0,0,0,0,0,0,0,-1,0,0,0,0,0,0,0,0,0,0,0,-1,-1,-1,-1,-1,-1,0,0,0,0,0,0,-1,0,0,0,0,0,-1,-1,-1,0,0,0,-1,0,0,0,-1,0,0,0,0,0,0,0,-1,0,0,0,0,0,-1,0,0,0,0,0,-1,-1,-1,-1,-1,0,-1,-1,-1,-1,-1,0,-1,0,-1,-1,-1,-1,-1,-1,-1,0,0,0,-1,0,0,-1,0,-1,0,0,0,0,-1,0,-1,-1,-1,0,0,0,0,0,0,0,0,0,-1,-1,-1,-1,-1,-1,0,0,0,0,-1,0,0,0,-1,0,0,0,0,0,0,0,0,0,-1,0,0,0,0,0,0,0,0,0,-1,0,0,0,-1,-1,-1,-1,-1,-1,-1,-1,0,0,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,0,-1,0,0,-1,0,0,0,0,0,0,0,0,0,0,-1,0,0,0,0,0,0,0,-1,0,-1,0,0,-1,0,0,0,0,0,0,0,0,0,0,-1,0,0,0,0,0,0,0,-1,0,-1,-1,-1,-1,0,-1,-1,0,0,0,0,0,0,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,-1,0,0,0,0,-1,0,0,0,0,0,0,0,-1,0,0,0,0,0,0,0,-1,0,0,0,0,0,0,0,-1,0,0,0,0,-1,-1,-1,-1,0,0,0,0,0,0,0,-1,-1,-1,-1,-1,-1,-1,-1,-1,0,0,0,-1,-1,0,0,0,0,0,0,0,0,0,0,-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,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
int game_player_x,game_player_y; 
int map1[17][24];
int game_number[17];
struct root{
    int a,b;
}vis_space[100],vis_number[100];
struct road{
    int x;
    int y;
}root[1000];
int hp;
int vis_num = 1;
int book[200][200] = {0};
int step1,step2,step;
int esc;
int end,start;
int game_d();
int game_p();
void time();
void ruler_k();
void game_ruler();
void game_map(int a);//打印游戏界面
void game_mark();//统计游戏成绩    
void game_player_printf(int x,int y,char face);
void game_player_printf1(int x,int y,int a);
void game_player_move_d();
void game_player_move_p();
void game_num();
void game_ch();
int game_finsh_p();
int game_finsh_d();
int game_finsh_j();
char num_d;
char game_cho;
int game_j();
int t,sl;
int flag;
DWORD WINAPI Find(LPVOID lpParamter);
DWORD WINAPI Fun(LPVOID lpParamter){
    while(num_d <= '9'){
        if(esc == 1)
            return 0;
        game_player_printf1(61,9,t); 
        t--;
        if(t == 8)
        game_player_printf(62,9,32); 
        if(t==0){
            game_player_printf1(61,9,t);
            return 0;   
        }
        Sleep(1000);   
    }  
    return 0L;
}
void game_num()
{
    int x=0;
    int y=0;
    int num = 1;
    int sum = 5;
    cout << endl << endl << endl << endl << endl << endl << endl;

    cout << "                                   LOADING" << endl << endl;
    cout << "                               ";
    ruler_k(); 
    game_player_printf(28,9,32);
    while(1){
    //  srand((unsigned)time(NULL));
        x=rand()%vis_num-1;
        Sleep(1000);
        if(book[vis_space[x].a][vis_space[x].b] == 1 || vis_space[x].a == 2&&vis_space[x].b==3)
            continue;                           
        vis_number[num].a = vis_space[x].b*2;
        vis_number[num].b = vis_space[x].a+2;
        book[vis_space[x].a][vis_space[x].b] = 1;
        cout << "▇";                     
        num++;
        if(num==10)
        break;
    }
}
void game_player_printf(int x, int y,char face)//x为两倍，y一倍+2 
{
    COORD pos = {x,y};
    HANDLE hOut = GetStdHandle(STD_OUTPUT_HANDLE); 
    SetConsoleCursorPosition(hOut, pos);
    cout << face << " ";
}
void game_player_printf1(int x, int y,int a)//x为两倍，y一倍+2 
{
    COORD pos = {x,y};
    HANDLE hOut = GetStdHandle(STD_OUTPUT_HANDLE); 
    SetConsoleCursorPosition(hOut, pos);
    cout << a ;
}
void game_map(int a){
    system("cls");
    if(a==2){
        cout << endl << endl;
        for(int i = 0;i<17;i++){
            for(int j = 0;j < 24;j++){
                if(map[i][j] == 0)
                    cout << "■";
                else if(map[i][j] == -1){
                    cout << "  ";
                    vis_space[vis_num].a = i;
                    vis_space[vis_num].b = j;
                    vis_num++;
                }
                else
                    cout << map[i][j] << " ";
            }
            if(i == 0)
                cout << "      得分     已走步数"; 
            if(i == 5)
                cout << "          倒计时"; 
            if(i == 10)
                cout <<"         操作说明";
            if(i == 12)
                cout <<"           w  ↑";
            if(i == 13)
                cout <<"           a  ←";
            if(i == 14)
                cout <<"           s  ↓";
            if(i == 15)
                cout <<"           d  →"; 
            cout << endl;

        }
        for(int i = 1;i<=9;i++){
            char c = i + '0';
            game_player_printf(vis_number[i].a,vis_number[i].b,c);
        }
    }
    else{
        for(int i = 0;i<17;i++){
            for(int j = 0;j < 24;j++){
                if(map[i][j] == 0){
                }
                else{
                    vis_space[vis_num].a = i;
                    vis_space[vis_num].b = j;
                    vis_num++;
                }
            }
        }
    }
}
/******************************
            单人模式 
******************************/
int game_d(){
    esc = 0;
    game_ch();
    game_map(1);
    game_num();
    game_map(2);
    Sleep(2000);
    game_player_move_d();
    if(esc == 1)
        return 2;
    return game_finsh_d();
}
void game_ch(){
    system("cls");
    cout << endl << endl << endl << endl << endl << endl <<"                                请选择模式";
    cout << endl <<"                                 1 简单";
    cout << endl <<"                                 2 普通";
    cout << endl <<"                                 3 困难";
    char ch;
    ch = getch();
    if(ch == '1'){
        sl = 300;
        t = 21;
    }
    else if(ch == '2'){
        sl = 200;
        t = 14;
    }
    else{
        sl = 100;
        t = 7;
    }

}
int game_finsh_d(){
    while(1){
        system("cls");
        int rot = 9*(300-step1/2);
        if(flag == 1){  
            cout << endl << endl << endl << endl << endl << "                    恭喜你，闯关成功！" << endl << endl; 
            cout << "                       得分："  << rot << endl;
        }
        else{
            cout << endl << endl << endl << endl << endl << "                    很遗憾，闯关失败！" << endl << endl;
        }
        cout << "              1 -> 再来一局  Esc -> 返回主界面" << endl;
        char choose;
        choose = getch();
        if(choose == '1')
            return 1; 
        if(choose == 27)
            return 2;
        else
            cout << "您的输入有误" << endl;
        cout << "按任意键继续";
        system("cls"); 
    } 
}
void game_player_move_d(){
        int  sum = 1;
        game_player_x = 2;
        game_player_y = 3;
        game_player_printf(game_player_x,game_player_y,1);
        int ch;
        num_d = '1';
        step = 1;
        game_player_printf(56,4,'0');
        game_player_printf1(67,4,0);
        if(game_cho == '1'){
            HANDLE hThread = CreateThread(NULL, 0, Fun, NULL, 0, NULL);
            CloseHandle(hThread);
        }
        flag = 0;
        hp = 1;
        end = 1;
        start = 1;
        root[1].x = 2;
        root[1].y = 3; 
        while(1){

                if(hp == 0&&game_cho == '2')
                    return ;
                if(game_cho == '2'){
                    if(sum == 4){
                        HANDLE hThread = CreateThread(NULL, 0, Find, NULL, 0, NULL);
                        CloseHandle(hThread);
                    }
                }
                sum ++;
                if(t==0)
                    return ;

                ch = getch();
                game_player_printf(game_player_x,game_player_y,1);
                int x = game_player_x;
                int y = game_player_y;
                switch(ch)
                {
                    case 80:
                        game_player_y++;
                        break;
                    case 72:
                        game_player_y--;
                        break;
                    case 75:
                        game_player_x -= 2;
                        break;
                    case 77:
                        game_player_x += 2;
                        break;
                    case 27:
                        esc = 1;
                        return ;
                        break;
                    default:
                        continue;
                }
                if(map[game_player_y-2][game_player_x/2] == 0){
                    game_player_x = x;
                    game_player_y = y;
                    continue;   
                }
                if(game_cho == '2'){
                    if(game_player_x == root[end].x && game_player_y == root[end].y)
                        return ;
                    root[start].x = game_player_x;
                    root[start].y = game_player_y;
                    start++;
                }


                game_player_printf(game_player_x,game_player_y,1);
                if(book[game_player_y-2][game_player_x/2] == 1){
                        game_player_printf(56,4,num_d);    
                        book[game_player_y-2][game_player_x/2] = 0;
                        num_d ++;
                }
                game_player_printf1(67,4,step);
                step += 1;


                game_player_printf(x,y,32);
                if(num_d > '9'){
                    flag = 1;
                    break;  
                }
                if(hp == 0){

                    return ;
                }
        }
}
/******************************
            绝命逃亡
******************************/
int game_j(){
    esc = 0;
    hp = 1;
    end = 1;
    start = 1; 
    game_ch();
    game_map(1);
    game_num();
    game_map(2);
    game_player_move_d();
    if(esc == 1)
        return 2;
    return game_finsh_j();
} 
DWORD WINAPI Find(LPVOID lpParamter)
{
    while(start > end){
        if(num_d > '9')
            break;
        Sleep(sl);
        game_player_printf(root[end].x,root[end].y,2);
        game_player_printf(root[end-1].x,root[end-1].y,32);
        end++;
        if(root[end - 1].x == game_player_x&&root[end - 1].y == game_player_y){
            hp = 0;
            return 0;
        }
    }
}
int game_finsh_j(){
    while(1){
        system("cls");
        int rot = 9*(300-step1/2);
        if(flag == 1){  
            cout << endl << endl << endl << endl << endl << "                    恭喜你，闯关成功！" << endl << endl; 
            cout << "                       得分："  << rot << endl;
        }
        else{
            cout << endl << endl << endl << endl << endl << "                    很遗憾，闯关失败！" << endl << endl;
        }
        cout << "              1 -> 再来一局  Esc -> 返回主界面" << endl;
        char choose;
        choose = getch();
        if(choose == '1')
            return 1; 
        if(choose == 27)
            return 2;
        else
            cout << "您的输入有误" << endl;
        cout << "按任意键继续";
        system("cls"); 
    } 
}
/******************************
              PVP
******************************/
int game_p(){
    esc = 0;
    game_map(1);
    game_num();
    game_map(2);
    game_player_move_p();
    if(esc == 1)
        return 2;
    return game_finsh_p();
}
void game_player_move_p(){
        int game_player_x1 = 26,game_player_x2 = 2;
        int game_player_y1 = 17,game_player_y2 = 3;
        game_player_printf(game_player_x1,game_player_y1,1);
        game_player_printf(game_player_x2,game_player_y2,2);
        int ch;
        char num1 = '1';
        char num2 = '1';
        step1 = 1;
        step2 = 1;
        game_player_printf(54,4,'0');
        game_player_printf(58,4,'0');
        game_player_printf1(65,4,0);
        game_player_printf1(68,4,0);
        while(1){
                int flag = 2;
                ch = getch();
                int x1 = game_player_x1;
                int y1 = game_player_y1;
                int x2 = game_player_x2;
                int y2 = game_player_y2;
                switch(ch)
                {
                    case 80:
                        game_player_y1++;
                        flag = 1;
                        break;
                    case 72:
                        game_player_y1--;
                        flag = 1;
                        break;
                    case 75:
                        game_player_x1 -= 2;
                        flag = 1;
                        break;
                    case 77:
                        game_player_x1 += 2;
                        flag = 1;
                        break;
                    case 27:
                        esc = 1;
                        return ;
                        break;
                    case 'w':
                        game_player_y2 --;
                        break;
                    case 's':
                        game_player_y2 ++;
                        break;
                    case 'a':
                        game_player_x2 -= 2;
                        break;
                    case 'd':
                        game_player_x2 +=2;
                        break; 
                    default:
                        continue;
                }
                if(flag == 1){
                    if(map[game_player_y1-2][game_player_x1/2] == 0||(game_player_y1==game_player_y2&&game_player_x1 == game_player_x2)){
                        game_player_x1 = x1;
                        game_player_y1 = y1;
                        continue;   
                    }   
                    game_player_printf(game_player_x1,game_player_y1,1);
                    if(book[game_player_y1-2][game_player_x1/2] == 1){
                        game_player_printf(54,4,num1);
                        book[game_player_y1-2][game_player_x1/2] = 0;
                        num1 ++;
                    }
                    game_player_printf1(65,4,step1);
                        step1 += 1;         
                    game_player_printf(x1,y1,32);
                }
                else{
                    if(map[game_player_y2-2][game_player_x2/2] == 0||(game_player_y1==game_player_y2&&game_player_x1 == game_player_x2)){
                        game_player_x2 = x2;
                        game_player_y2 = y2;
                        continue;
                    }
                    game_player_printf(game_player_x2,game_player_y2,2);
                    if(book[game_player_y2-2][game_player_x2/2] == 1){
                        game_player_printf(58,4,num2);
                        book[game_player_y2-2][game_player_x2/2] = 0;
                        num2 ++;
                    }
                    game_player_printf1(68,4,step2);
                    step2 += 1;            
                    game_player_printf(x2,y2,32);
                }
                if((num1 + num2) > '0'+'9' + 1)
                    break;
        }
}
int game_finsh_p(){
    while(1){
        system("cls");
        int rot1 = 9*(300-step1/2);
        int rot2 = 9*(300-step2/2);
        char face; 
        cout << endl << endl << endl << endl << endl << "                        游戏结束！" << endl << endl; 
        cout << "                     play1得分："  << rot1 << endl;
        cout << "                     play2得分："  << rot2 << endl;
        if(rot1>rot2){
            face = 1;
            cout <<"                    play1胜利"; 
            game_player_printf(58,6,face);
        }
        else{
            face = 2;
            cout <<"                    play2胜利"; 
            game_player_printf(58,6,face);
        }
        cout << endl << "             1 -> 再来一局  2 -> 返回主界面" << endl;
        char choose;
        choose = getch();
        if(choose == '1')
            return 1; 
        if(choose == 27)
            return 2;
        else
            cout << "您的输入有误" << endl;
        cout << "按任意键继续";
        system("cls"); 
    } 
}
/******************************
              PVE
******************************/

/***********************************************
                   ruler函数 
************************************************/
void ruler_k(){
    if(game_cho == '1'){
        COORD pos = {10,13};
        HANDLE hOut = GetStdHandle(STD_OUTPUT_HANDLE); 
        SetConsoleCursorPosition(hOut, pos);
        cout << "经典迷宫：玩家只需要操作人物在时限内吃完所有数字即可获得胜利";
    }
    else if(game_cho == '2'){
        COORD pos = {9,13};
        HANDLE hOut = GetStdHandle(STD_OUTPUT_HANDLE); 
        SetConsoleCursorPosition(hOut, pos);
        cout << "绝命逃亡：玩家在控制人物吃数字时会有怪物追踪玩家，遭遇怪物后游戏失败";
    }
    else if(game_cho == '3'){
        COORD pos = {10,13};
        HANDLE hOut = GetStdHandle(STD_OUTPUT_HANDLE); 
        SetConsoleCursorPosition(hOut, pos);
        cout << "PVP：玩家1用↑↓←→控制方向，玩家2用wasd控制方向，分数多者获胜";
    }
}
void ruler(){
    cout << endl << endl << endl << endl << endl << endl;
    cout << "                               玩法介绍" << endl;
    cout << "    本游戏玩法简单，玩家只要控制wasd,就可以控制人物笑脸上下左右移动"; 
    cout << endl << endl << endl << "按任意键继续"; 
    char s = getch();
}
int main(){
    system("color 80"); 
    while(1){
        system("cls");
        main_show();
        cout << "                                请输入您的选择" << endl;
        game_cho = getch();
        if(game_cho< '1'||game_cho > '5'){
            cout << endl << "                              操作错误，请重新输入" << endl;
            Sleep(2000); 
            continue;
        }
        memset(book,0,sizeof(book));
        system("cls");
        if(game_cho == '1'){
            while(1){
                if(game_d()==2)
                    break;
            }   
        }
        else if(game_cho == '2'){
            while(1){
                if(game_j()==2)
                    break;
            }   
        }
        else if(game_cho == '3'){
            while(1){
                if(game_p()==2)
                    break; 
            }   
        }
        else if(game_cho == '4'){
            system("cls");
            cout << endl << endl << endl << endl; 
            cout << "          老夫还没写。。。。。只会dp+深搜+暴力+贪心。。。";
            cout << "                 老夫要写的好，就去写AlphaGo了";
            Sleep(5000);
        }
        else
            return 0;
    }
    return 0;
}
LAN74__
关注
  • 0
    点赞
  • 踩
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
c++语言制作的数字迷宫
09-08
C++实训时做的数字迷宫分享一下！希望你能做的比我们更好！
数字迷宫小游戏
11-26
制作一个《数字迷宫》的游戏： 1、地图内部包含墙体、走廊、阿拉伯数字(1~7)、玩家头像(1个)四种不同内容 2、用户通过上、下、左、右按键来控制玩家头像在地图范围内的走动 3、在玩家走动过程中，碰撞墙壁时，该步的...
C语言实训——数字迷宫
qq_43345339的博客
07-08 1819
数字迷宫 第一部分 案例描述 案例目的 本案例为实现动态的刷新Dos界面，使用用户控制头像“消灭”窗口中出现的数字(无固定顺序)的游戏，来使学员加深对一维数组、二维数组、循环语句、选择程序设计以及相关系统函数的使用。 案例难度 ★★★★ 案例覆盖技能点 选择程序设计 循环程序设计 用户、屏幕窗口的输入输出 相关...
C语言---数字迷宫
Jeason的博客
07-08 1668
title: C语言–数字迷宫 Date: 2016/7/10 Description: 1、 系统主要地图为固定模式 2、 地图内部包含墙体、走廊、阿拉伯数字(1~7)、玩家头像(1个)四种不同内容 3、 用户通过上、下、左、右按键来控制玩家头像在地图范围内的走动
数字迷宫的c实训报告
07-27
【C语言实训报告——数字迷宫】 数字迷宫是一个经典的编程练习，通常用于教授C语言中的数组操作、逻辑控制和用户交互。在这个实训项目中，学生徐轲通过C语言实现了一个数字迷宫游戏，该游戏可能包含多个关卡，每个...
数字迷宫求解数据结构c语言
04-09
数字迷宫求解，迷宫求解的一篇短小论文，利用栈结构写得c语音，程序完整。
VHDL数字迷宫自主设计报告
01-29
使用VHDL语言设计并调试数字迷宫，并下载到FPGA板上调试
数字迷宫思考-上
scuhank的专栏
11-07 1123
 数字迷宫思考-上                                                        ----用栈的方法实现 数字迷宫游戏，可以用递归和栈的方法来实现穷举搜索通往出口的路径。实现的过程中，需要建立一个表示迷宫的二维数组，数组中的每个元素用0、1表示，0为此节点是通路，1表示断路，不能继续前行。迷宫的四周都是1表示的墙，只有一个入口和一个出
数据结构-C++ 迷宫
weixin_38479224的博客
05-10 447
迷宫： #include #include "missingRoom.h" using namespace std; void main() { missingRoom a; a.find(); system("pause"); return; } #include "missingRoom.h" #include using namespace st
数据结构课设：迷宫问题（c语言版）
热门推荐
qq_45804132的博客
05-07 1万+
迷宫求解问题 题目描述 用一个m×n的矩阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对给定的迷宫，求出找到的第一条从入口到出口的通路，或得到没有通路的结论。 我们指定: 迷宫的入口为矩阵的左上角（1,1），迷宫的出口为右下角（m,n）; 路径的探索顺序依次为"东南西北"（即：右下左上）。 输入 第一行输入两个整数，空格间隔，分别表示矩阵的行数m和列数n； 接下来的连续m...
POJ1163-数字迷宫（递归加动态规划练习）
wwxy1995的博客
05-02 572
The TriangleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 55486 Accepted: 33354Description7 3 8 8 1 0 2 7 4 4 4 5 2 6 5 (Figure 1)Figure 1 shows a number triangle. Wri...
实训项目 数字迷宫小游戏
minose的博客
07-21 880
数字迷宫 第一部分 案例描述 案例目的 本案例为实现动态的刷新Dos界面，使用用户控制头像“消灭”窗口中出现的数字(无固定顺序)的游戏，来使学员加深对一维数组、二维数组、循环语句、选择程序设计以及相关系统函数的使用。 案例难度 ★★★★ 案例覆盖技能点 a) 选择程序设计 b) 循环程序设计 c) 用户、屏幕窗口的输入输出 d) 相关系统函数 e
数字迷宫思考-下
scuhank的专栏
11-07 734
数字迷宫思考-下-----用递归的方法实现数字迷宫数字迷宫，可以用栈和递归的方法实现。通常情况下，递归都比较容易实现，因此，试着用递归的方法来实现数字迷宫游戏。虽然递归相对比较简单，但是，当递归次数较多时，可能会造成代码空间的增大；另外，在最后显示通路路径的时候，存在一个问题：显示只能从出口到入口倒着显示路径信息，这是不方便的。不过，将递归当着一种方法来解决问题，也是值得尝试的。下附上数字
实训第三天--数字迷宫
勿忘初心丶
07-11 437
# include # include # include # include # include # include "windows.h" char c=1;              int x,y,t1,t2;               int count=7;  int code[17][24]={0,0,0,0,0,0,0,0,0,0,0,0,0,0
数字迷宫 暴力
最新发布
2303_79132118的博客
04-06 178
【代码】数字迷宫 暴力。
数字迷宫小游戏源代码
曌的博客
07-10 4049
数字迷宫 案例需求 本案例要求制作一个《数字迷宫》的游戏，该游戏的玩法描述为： 1、 系统主要地图为固定模式 2、 地图内部包含墙体、走廊、阿拉伯数字(1~7)、玩家头像(1个)四种不同内容 3、 用户通过上、下、左、右按键来控制玩家头像在地图范围内的走动 4、 在玩家走动过程中，碰撞墙壁时，该步的走动无效，玩家头像原地不变 5、 玩家允许在设计走廊内部进行走
迷宫问题的通用解法C语言数据结构实现
徐奕的专栏
06-19 6868
1.1问题描述 以一个m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。1.2基本要求 输入的形式和范围： 非递归：行列为整型，坐标为整型递归：迷宫以整型二维数组形式输入输出的形式：非递归输出三元组通路和方阵通路； 递归以方阵输出迷宫和所有通路；1、非递归算法，求一条通路输出三元组形式如：（1，1，1）
详细写游戏：数字迷宫：这是一种比较有趣的数学游戏，它的目标是在一个迷宫中找到从起点到终点的路径。每个格子上都有一个数字，玩家需要按照某种规律来选择下一步的方向，最终到达终点。
06-08
好的，下面是数字迷宫游戏的详细玩法： 1. 准备工作：老师需要准备一个数字迷宫，迷宫中包含若干个格子，每个格子上都有一个数字。老师还需要确定起点和终点，并且规定玩家只能按照某种规律来选择下一步的方向。 2...

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值