这是一个关于马走格子的算法问题，通过BFS（广度优先搜索）来寻找从起点到终点最少步数。输入包括棋盘大小和起始、结束位置，输出为最少步数。代码中使用了队列进行搜索，并利用二维布尔数组记录已访问位置。
Description
Background
Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from one position to another so fast. Can you beat him?
The Problem
Your task is to write a program to calculate the minimum number of moves needed for a knight to reach one point from another, so that you have the chance to be faster than Somurolov.
For people not familiar with chess, the possible k
Mr Somurolov, fabulous chess-gamer indeed, asserts that no one else but him can move knights from one position to another so fast. Can you beat him?
The Problem
Your task is to write a program to calculate the minimum number of moves needed for a knight to reach one point from another, so that you have the chance to be faster than Somurolov.
For people not familiar with chess, the possible k
最低0.47元/天 解锁文章
411
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
