这是一个采用C++编写的、采用回溯法编写的骑士周游（马周游）遍历棋盘（8*8）的程序。本软件采用MFC编写，用户可看到骑士动态遍历棋盘的过程。-This is a written in C++ using backtracking written knight tour (horse travel) through the board (8* 8) program. The software is written using MFC, you can see the board through

递归算法的实例--以骑士巡游为例做的控制台程序。主要设计到了递归回溯算法-Examples of recursive algorithms- to Knight-tour of the console to do the procedure as an example. The main design to a recursive backtracking algorithm

使用回溯法解决的典型问题的算法：骑士巡游问题，n皇后问题，0-1背包问题。 使用递归与分治策略解决的几个问题的算法：Hanoi塔问题和二分搜索技术。-Uses backtracking method to solve the problems of the typical algorithms: the knight tour problem, n queen problem, 0-1 knapsack problem. Recursion and divide and conq