Knight Minimum Moves

Prereq: BFS on Graph

On an infinitely large chessboard, a knight is located on [0, 0].

A knight can move in eight directions.

Given a destination coordinate [x, y], determine the minimum number of moves from [0, 0] to [x, y].

Title

Script

Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book.

Contrary to popular belief, Lorem Ipsum is not simply random text.

  >>> a = [1, 2, 3]
  >>> a[-1]
  3

Get premium for instant access to all content and solutions

Upgrade