Description: Nine squares path problem, using the depth-first traversal method to traverse the depth under 6 layer, if the path is less than 6 layer depth, the output of its path, if more than six floors, are illustrated.
To Search:
File list (Check if you may need any files):
dujunnan_ddp_puzzle\.classpath
...................\.project
...................\.settings\org.eclipse.jdt.core.prefs
...................\bin\pathReco.class
...................\...\PuzzleDeep$1.class
...................\...\PuzzleDeep$10.class
...................\...\PuzzleDeep$11.class
...................\...\PuzzleDeep$12.class
...................\...\PuzzleDeep$13.class
...................\...\PuzzleDeep$14.class
...................\...\PuzzleDeep$15.class
...................\...\PuzzleDeep$16.class
...................\...\PuzzleDeep$2.class
...................\...\PuzzleDeep$3.class
...................\...\PuzzleDeep$4.class
...................\...\PuzzleDeep$5.class
...................\...\PuzzleDeep$6.class
...................\...\PuzzleDeep$7.class
...................\...\PuzzleDeep$8.class
...................\...\PuzzleDeep$9.class
...................\...\PuzzleDeep.class
...................\src\pathReco.java
...................\...\PuzzleDeep.java
...................\.settings
...................\bin
...................\src
dujunnan_ddp_puzzle
Download