Knight Travel Speed

Submit

Language is selected by the extension of the file. See the list of supported languages to know the extension of your language.

Problem

Given two chessboard positions as 0-indexed coordinate pairs, determine the minimum number of moves required for a knight to move from one square to the other. The knight's position may not exceed 0 <= x < 8 on either axis.

Options

exec is denied

rejudge feature is enabled

now post-mortem time, all source codes will be revealed

Sample input:_

((0, 0), (2, 1))
((0, 0), (2, 0))
((0, 0), (0, 1))

Sample output:

1
2
3

Sample input:_

((5, 5), (5, 6))
((4, 4), (5, 5))
((0, 0), (1, 1))

Sample output:

3
2
4

Sample input:_

((0, 0), (6, 6))
((0, 0), (0, 0))

Sample output:

4
0

Ranking

Ruby _

Ruby2 _

Python _

Python3 _

C _

Haskell _

sed _

jq _

gs2 _

Nibbles _

Scala _

Language Ranking_

return to the top page