Description: Knight traveled the problem gives a description of the problem with n2 a lattice of n × n board (as shown in Figure 3-14), a knight from the initial position (x0, y0) began, in accordance with " horse jumping day" rule In the board moving. Q: Can n2 1 traverse the board, within steps of all positions that each lattice traveled just once, if we can, find such a traveling program to
To Search:
- [Taohui] - can deal with the problem in the stock m
- [qishi] - C++ based on shortest path to do the sou
- [qishiyouli] - Comparison of the classical algorithm fo
File list (Check if you may need any files):
骑士游历问题\aa.c
............\骑士游历问题.c
骑士游历问题
Download