Knight Moves --bfs
2017-02-04 12:29
120 查看
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.
Input
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 pair of integers {0, …, l-1}*{0, …, l-1} specifying the starting and ending position of the knight on the board. The integers are separated by a single blank. You can assume that the positions are valid positions on the chess board of that scenario.
Output
For each scenario of the input you have to calculate the minimal amount of knight moves which are necessary to move from the starting point to the ending point. If starting point and ending point are equal,distance is zero. The distance must be written on a single line.Sample Input
38
0 0
7 0
100
0 0
30 50
10
1 1
1 1
Sample Output
528
0
题解
相关文章推荐
- POJ 2243 ZOJ 1091 UVaOJ 439 Knight moves(BFS广度优先搜索)
- Knight Moves BFS 水题
- //广搜bfs//Knight Moves------三T
- HDU1372:Knight Moves(BFS)
- ZOJ 1091 (HDU 1372) Knight Moves(BFS)
- hud 1372 Knight Moves【bfs】
- hdu-1372-Knight Moves(bfs和dfs)
- HDU-#1372 Knight Moves(双向BFS)
- HDU 1372 Knight Moves 【经典BFS】
- HDOJ/HDU 1372 Knight Moves(经典BFS)
- HDU 1372--Knight Moves【BFS】
- hdoj 1372 Knight Moves 【BFS+优先队列】
- HDU [ Knight Moves ]——简单BFS
- POJ 1915 Knight Moves (经典的BFS) --from lanshui_Yang
- HOJ 1440 Knight Moves -------简单搜索 BFS 求l两点之间最小的到达步数
- HDU 1372 广度优先搜索(BFS) Knight Moves
- poj 1915 Knight Moves【BFS】【简单】
- UVA 439 Knight Moves --DFS or BFS
- 439 - Knight Moves (用的 bfs 做的,个人感觉bfs更适合这道题)
- POJ 1915-Knight Moves (单向BFS && 双向BFS 比较)