Description: Use BFS algorithm and queue on the board to achieve a known " horse" in the initial position, get the function which can be reached within a specified number of steps in all positions
To Search:
File list (Check if you may need any files):
BFSTraverse\BFSTraverse\BFSTraverse.c
BFSTraverse
...........\BFSTraverse
...........\...........\BFSTraverse.h
...........\...........\BFSTraverse.vcxproj
...........\...........\BFSTraverse.vcxproj.filters
...........\...........\BFSTraverse.vcxproj.user
...........\...........\Debug
...........\...........\.....\BFSTraverse.Build.CppClean.log
...........\...........\.....\BFSTraverse.exe.intermediate.manifest
...........\...........\.....\BFSTraverse.lastbuildstate
...........\...........\.....\BFSTraverse.log
...........\...........\.....\BFSTraverse.obj
...........\...........\.....\CL.read.1.tlog
...........\...........\.....\CL.write.1.tlog
...........\...........\.....\link.read.1.tlog
...........\...........\.....\link.write.1.tlog
...........\...........\.....\mt.read.1.tlog
...........\...........\.....\mt.write.1.tlog
...........\...........\.....\vc100.idb
...........\...........\.....\vc100.pdb
...........\BFSTraverse.sdf
...........\BFSTraverse.sln
...........\BFSTraverse.suo
...........\Debug
...........\.....\BFSTraverse.exe
...........\.....\BFSTraverse.ilk
...........\.....\BFSTraverse.pdb
...........\ipch
...........\....\bfstraverse-12d5f5fa
...........\....\....................\bfstraverse-5177e2b3.ipch
Download