这个包裹实现的是分支限界法解决n王后问题，input.txt和output.txt分别掌管输入n和输出一种方案-This package implements a branch and bound method to solve the n queens problem, input.txt and output.txt were in charge of input and output of a program of n

在一个n*n的棋盘上跳马的方式走遍所有格子，用分支限界法解决。-Branch and bound method to solve the knight journey