该算法首先根据输入的节点数（该程序可选的有3X3，4X4…9X9几种节点数），然后输入初始状态和终点状态...
资 源 简 介
该算法首先根据输入的节点数（该程序可选的有3X3，4X4…9X9几种节点数），然后输入初始状态和终点状态-the algorithm depending on the input nodes (which are optional procedures 3X3, 4X4 ... Frankfurt several nodes), then the initial state and the end of state
文 件 列 表
有界深度优先算法
BlockFace$checkObject.class
Block.class
BlockFace$1.class
BlockFace$checkFirst.class
BlockFace$ChooseBlockNUM.class
BlockFace.class
MoveBlock$1.class
MoveBlock.class
test.class
testBlock.class
BlockFace.java
Diamond.java
MoveBlock.java
MoveBlock$ButtonListener.class
Block.java
