Introduction - If you have any usage issues, please Google them yourself
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
Packet : 604101有界深度优先算法八数码问题.rar filelist
有界深度优先算法
有界深度优先算法\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