Description: Travel chess problems in horses given a 8 × 8 chessboard, given a particular location. Horse from the starting seek position, after the board of each square exactly once, and finally back to its starting position of the road map. Requirements: Dynamic presentation with graphical horse routes, backtracking process.
To Search:
- [Horse-zym] - C# to write a horse around the algorithm
- [TourOfKnight] - Ma tour- 8* 8 chessboard, using the dyna
File list (Check if you may need any files):
回溯源码\.classpath
........\.project
........\.settings\org.eclipse.jdt.core.prefs
........\backtrace.jar
........\.in\BackTrace.class
........\...\Local.class
........\...\State.class
........\...\test3.class
........\ma.jpg
........\src\test3.java
........\.settings
........\bin
........\src
回溯源码
Download