1、题目概述:
该题是一道典型的迷宫类搜索题目,为了达到运行效率的要求,需要采取剪枝的策略。所谓剪枝,就是根据题目的特性,将一些没必要的搜索过程省去,从而提高算法的时间效率。
2、题目分析:
问题:
小狗能否从起点S,经过时间T,恰好到达终点D。
条件:
1、Therefore the doggie had to arrive at the door on exactly the T-th second.(小狗必须在T时刻准时到达出口)
2、In every second, he could move one block to one of the upper, lower, left and right neighboring blocks.(每一秒,小狗可以向上下左右四个方向移动一步)
3、He could not stay at one block for more than one second,(他只能在一个位置上待一秒钟)