国际象棋盘上的马能否从某点出发而跳遍每一点,且每点只过一次,这是一个有趣的古典数学问题,也称作“骑士旅游”问题,或称寻找棋盘上的马步哈密尔顿路问题。 还有一个问题是,考虑任一个纵横跳m,n个格的马,或称为(m,n)广义马能否跳遍全盘的问题。特别是考虑在一个格点平面上,如果有一 Whether a horse on a chessboard can jump from one point to another and only once per point, this is an interesting classical mathematics problem, also known as the “knight tourism” issue, or the search for horses on a chessboard Step Hamilton Road Problem. There is also a question of considering whether any horse with a horizontal hop m, n grids, or (m,n) general horse can jump over the whole game. Especially considering a grid plane, if there is a