openjudge_2.5基本算法之搜索_917:Knight Moves

最新推荐文章于 2025-12-18 17:00:31 发布

原创

最新推荐文章于 2025-12-18 17:00:31 发布 · 856 阅读

17 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #c++

题目

917:Knight Moves
总时间限制: 1000ms 内存限制: 65536kB
描述
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 knight moves are shown in Figure 1.
在这里插入图片描述

输入
The input begins with the number n of scenarios on a single line by itself.
Next follow n scenarios. Each scenario consists of three lines containing integer numbers. The first line specifies the length l of a side of the chess board (4 <= l <= 300). The entire board has size l * l. The second and third line contain p