用深度优先、广度优先算法解决八数码问题

[{"title":"（ 18 个子文件 47KB ） 用深度优先、广度优先算法解决八数码问题","children":[{"title":"EightPuzzle","children":[{"title":"EightPuzzle","children":[{"title":"ReadMe.txt <span style='color:#111;'> 2.77KB </span>","children":null,"spread":false},{"title":"EightPuzzle.vcproj.yangtianzhi-PC.yangtianzhi.user <span style='color:#111;'> 1.39KB </span>","children":null,"spread":false},{"title":"res","children":[{"title":"EightPuzzle.rc2 <span style='color:#111;'> 367B </span>","children":null,"spread":false},{"title":"EightPuzzle.ico <span style='color:#111;'> 21.12KB </span>","children":null,"spread":false}],"spread":true},{"title":"EightPuzzleDlg.h <span style='color:#111;'> 1.16KB </span>","children":null,"spread":false},{"title":"stdafx.h <span style='color:#111;'> 2.43KB </span>","children":null,"spread":false},{"title":"stdafx.cpp <span style='color:#111;'> 142B </span>","children":null,"spread":false},{"title":"EightPuzzle.vcproj <span style='color:#111;'> 5.50KB </span>","children":null,"spread":false},{"title":"BfsDfs.h <span style='color:#111;'> 1.38KB </span>","children":null,"spread":false},{"title":"resource.h <span style='color:#111;'> 1.70KB </span>","children":null,"spread":false},{"title":"EightPuzzle.rc <span style='color:#111;'> 14.31KB </span>","children":null,"spread":false},{"title":"BfsDfs.cpp <span style='color:#111;'> 5.01KB </span>","children":null,"spread":false},{"title":"EightPuzzleDlg.cpp <span style='color:#111;'> 6.64KB </span>","children":null,"spread":false},{"title":"EightPuzzle.cpp <span style='color:#111;'> 1.67KB </span>","children":null,"spread":false},{"title":"EightPuzzle.h <span style='color:#111;'> 471B </span>","children":null,"spread":false},{"title":"EightPuzzle.aps <span style='color:#111;'> 60.24KB </span>","children":null,"spread":false}],"spread":false},{"title":"EightPuzzle.suo <span style='color:#111;'> 15.00KB </span>","children":null,"spread":false},{"title":"EightPuzzle.sln <span style='color:#111;'> 898B </span>","children":null,"spread":false}],"spread":true}],"spread":true}]