国际象棋骑士遍历问题

国际象棋的骑士遍历也称跳马问题、马踏棋盘问题：在8*8方格的国际象棋棋盘上，从任意指定的方格出发，为象棋中的马寻找一条走遍棋盘每一格并且只经过一次的一条路径。程序从“深度优先”、“广度优先”两种算法思想入手，并设计了Java GUI界面，很好地展示了骑士遍历的过程。

src
Assignment2.class
Assignment2.java
black.gif
Dimension.class
Dimension.java
DimensionInterface.class
DimensionInterface.java
Display.class
Display.java
DisplayInterface.class
DisplayInterface.java
EmptyQueueException.class
EmptyQueueException.java
EmptyStackException.class
EmptyStackException.java
EmptyTreeException.class
Grid.class
Grid.java
GridInterface.class
GridInterface.java
IllegalGridException.class
IllegalGridException.java
knight.gif
KnightsTour$1.class
KnightsTour.class
KnightsTour.java
Location.class
Location.java
LocationInterface.class
LocationInterface.java
Node.class
Node.java
NodeInterface.class
NodeInterface.java
Queue.class
Queue.java
QueueInterface.class
QueueInterface.java
Square.class
Square.java
SquareInterface.class
SquareInterface.java
Stack.class
Stack.java
StackInterface.class
StackInterface.java
Symbol.class
Symbol.java
SymbolInterface.class
SymbolInterface.java
TNode.class
TNode.java
TNodeInterface.class
TNodeInterface.java
Tree.class
Tree.java
TreeEx.java
TreeInterface.class
TreeInterface.java
white.gif