搜索资源列表
tiaoma
- 在5*5格的棋盘上从点出发， 按日字跳马， 要求不重复地跳经所有方格。 求出所有跳马方案？-5* 5 grid of the chessboard from the point of view, the word daily vault, repeatedly asked not to jump through all the boxes. Obtained all the horse program?
knight
- 在一个n*n的棋盘上跳马的方式走遍所有格子，用分支限界法解决。-Branch and bound method to solve the knight journey
FindHorseWay
- 跳马问题 4*5的棋盘任意一点放置一个棋子，按照中国象棋马的走法，周游棋盘并能回到原点的所有路径-jump horse problem
Vault
- 跳马问题 有一m*n的棋盘（即棋盘由m行和n列），一马放在棋盘中任意位置，马按中国象棋跳法，从初始位置起跳，跳至边界后返回，求所有能返回初始位置的周游路线。-Vault with an m* n chessboard (ie board consisting of m rows and n columns), a horse anywhere on the board, according to Chinese chess horse jump method, from the initia
gis_1
- GIS算法中的经典题目，跳马问题，从一个格子出发到达边界即可返回。-GIS algorithm classic title, vault question, a starting grid reaches the boundary to return.