改良填充法实现和解决迷宫问题  

Improved Filling Method to Realize and Solve Maze Prroblem

作　　者：周蕾[1] 周颖[2] ZHOU Lei,ZHOU Ying （1 ,Taizhou Higher Vocational School Of Mechanical ＆ Electrical Technology,Taizhou 225300 China;2,School of Computer Science＆Engineering, Southeast University, Nanjing 210096 China）

机构地区：[1]泰州机电高等职业技术学校,江苏泰州225300 [2]东南大学计算机科学与工程学院,江苏南京210096

出　　处：《电脑知识与技术》2007年第7期186-188,共3页Computer Knowledge and Technology

摘　　要：与传统的“回溯”法相比,用填充法解决迷宫问题具有节约空间、提高效率的优点。本文探讨了填充法实现过程中的若干操作层面的问题,例如：如何快速扫描所有死路,如何解决单一出口的环路问题,如何填充稀疏空地等,提出了改良填充法,最后给出了用改良填充法解决迷宫问题的C程序。The filling approach to solve the maze problem uses less storage and is more efficient than the recall approach, This .paper discusses such operational problems emerging in applying the filling approach to the maze problem as how to find all dead paths quickly, how to deal with the cycles with a single exit, how to fill sparse fields, then suggests an improved filling approach and finally presents the C program of solving the maze problem based on the improved filling approach.

关 键 词：迷宫问题 死路 可行点 填充 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论;自动化与计算机技术—计算机科学与技术]