用户注册



邮箱:

密码:

用户登录


邮箱:

密码:
记住登录一个月忘记密码?

发表随想


还能输入:200字
云代码 - c代码库

老鼠走迷宫算法改进版(求所有走法)回溯算法 c语言

2012-11-02 作者: 小蜜锋举报

[c]代码库

#include <stdio.h>
#include <stdlib.h>
 
void visit ( int, int );
 
int maze[9][9] = {{2, 2, 2, 2, 2, 2, 2, 2, 2},
    {2, 0, 0, 0, 0, 0, 0, 0, 2},
    {2, 0, 2, 2, 0, 2, 2, 0, 2},
    {2, 0, 2, 0, 0, 2, 0, 0, 2},
    {2, 0, 2, 0, 2, 0, 2, 0, 2},
    {2, 0, 0, 0, 0, 0, 2, 0, 2},
    {2, 2, 0, 2, 2, 0, 2, 2, 2},
    {2, 0, 0, 0, 0, 0, 0, 0, 2},
    {2, 2, 2, 2, 2, 2, 2, 2, 2}
};
 
int startI = 1, startJ = 1;  // 入口
int endI = 7, endJ = 7;  // 出口
 
int main ( void )
{
    int i, j;
 
    printf ( "显示迷宫:\n" );
    for ( i = 0; i < 9; i++ )
    {
        for ( j = 0; j < 9; j++ )
            if ( maze[i][j] == 2 )
                printf ( "█" );
            else
                printf ( "  " );
        printf ( "\n" );
    }
 
    visit ( startI, startJ );
 
    return 0;
}
 
void visit ( int i, int j )
{
    int m, n;
 
    maze[i][j] = 1;
 
    if ( i == endI && j == endJ )
    {
        printf ( "\n显示路径:\n" );
        for ( m = 0; m < 9; m++ )
        {
            for ( n = 0; n < 9; n++ )
                if ( maze[m][n] == 2 )
                    printf ( "█" );
                else if ( maze[m][n] == 1 )
                    printf ( "◇" );
                else
                    printf ( "  " );
            printf ( "\n" );
        }
    }
 
    if ( maze[i][j+1] == 0 ) visit ( i, j+1 );
    if ( maze[i+1][j] == 0 ) visit ( i+1, j );
    if ( maze[i][j-1] == 0 ) visit ( i, j-1 );
    if ( maze[i-1][j] == 0 ) visit ( i-1, j );
 
    maze[i][j] = 0;
}

[代码运行效果截图]


老鼠走迷宫算法改进版(求所有走法)回溯算法 c语言


网友评论    (发表评论)


发表评论:

评论须知:

  • 1、评论每次加2分,每天上限为30;
  • 2、请文明用语,共同创建干净的技术交流环境;
  • 3、若被发现提交非法信息,评论将会被删除,并且给予扣分处理,严重者给予封号处理;
  • 4、请勿发布广告信息或其他无关评论,否则将会删除评论并扣分,严重者给予封号处理。


扫码下载

加载中,请稍后...

输入口令后可复制整站源码

加载中,请稍后...