<span style="font-family:宋体;">实验目的：</span><span style="font-family:'Microsoft Yahei';"> <span></span></span>

<span style="font-family:宋体;">　　１、熟悉队列的实现和使用；</span><span style="font-family:'Microsoft Yahei';"> <span></span></span>

<span style="font-family:宋体;">　　２、掌握一种路径搜索算法；</span><span style="font-family:'Microsoft Yahei';"> <span></span></span>

<span style="font-family:宋体;">实验原理：</span><span style="font-family:'Microsoft Yahei';"> <span></span></span>

<span style="font-family:宋体;">　　１、队列的原理：略</span><span style="font-family:'Microsoft Yahei';"> <span></span></span>

<span style="font-family:宋体;">　　２、路径搜索算法的原理：利用队列记忆已经达到过，但还未展开搜索的地点，可以将所有地点无遗漏无重复的搜索到。</span><span style="font-family:'Microsoft Yahei';"> <span></span></span>

<span style="font-family:宋体;">实验步骤：</span><span style="font-family:'Microsoft Yahei';"> <span></span></span>

<span style="font-family:宋体;">　　１、定义坐标点类；</span><span style="font-family:'Microsoft Yahei';"> <span></span></span>

<span style="font-family:宋体;">　　２、定义实现循环队列类，该类要求可以存储若干个坐标点。</span><span style="font-family:'Microsoft Yahei';"> <span></span></span>

<span style="font-family:宋体;">　　３、利用队列实现路径搜索算法。</span><span style="font-family:'Microsoft Yahei';"> <span></span></span>

<span style="font-family:宋体;">　　４、完成输入输出控制。</span><span style="font-family:'Microsoft Yahei';"> <span></span></span>

<span style="font-family:宋体;">输入由多个迷宫组成，每个迷宫开始一行是两个数字</span><span style="font-family:'Microsoft Yahei';">n</span><span style="font-family:宋体;">和</span><span style="font-family:'Microsoft Yahei';">m</span><span style="font-family:宋体;">，表示迷宫的行列数量</span><span style="font-family:'Microsoft Yahei';"> <span></span></span>

<span style="font-family:宋体;">接下来的</span><span style="font-family:'Microsoft Yahei';">n</span><span style="font-family:宋体;">行是迷宫的字符图案</span> 

<span style="font-family:宋体;">图案中的字符</span><span style="font-family:'Microsoft Yahei';">B</span><span style="font-family:宋体;">表示可能的宝箱，空格表示可以走动的空间，其它字符表示障碍物</span><span style="font-family:'Microsoft Yahei';"> <span></span></span>

<span style="font-family:宋体;">图案的行列坐标是以</span><span style="font-family:'Microsoft Yahei';">0</span><span style="font-family:宋体;">开始计算的，坐标</span><span style="font-family:'Microsoft Yahei';">x=1,y=0</span><span style="font-family:宋体;">处一定是迷宫出入口</span><span style="font-family:'Microsoft Yahei';"> <span></span></span>

<span style="font-family:宋体;">对应每个迷宫，应该有一行输出</span><span style="font-family:'Microsoft Yahei';"> <span></span></span>

<span style="font-family:宋体;">如果找到宝箱，输出为：</span><span style="font-family:'Microsoft Yahei';">Box is found at x=</span><span style="font-family:宋体;">宝箱</span><span style="font-family:'Microsoft Yahei';">x</span><span style="font-family:宋体;">坐标</span><span style="font-family:'Microsoft Yahei';"> y=</span><span style="font-family:宋体;">宝箱</span><span style="font-family:'Microsoft Yahei';">y</span><span style="font-family:宋体;">坐标</span><span style="font-family:'Microsoft Yahei';">. </span>

<span style="font-family:宋体;">如果找不到宝箱，输出为：</span><span style="font-family:'Microsoft Yahei';">Box is not found. </span>