IOM 2019, Блиц — Задача 48

OLYMPIAD OF METROPOLISES, Moscow, September 2, 2019 · 2 септември 2019 г.

Условие

You are given an infinite chessboard. Each cell of this board corresponds to a pair of integer coordinates. What is the minimum number of moves a chess knight needs to get from the cell (2, 9) to the cell (20, 19)? (Each time the chess knight moves to a square that is two squares away horizontally and one square away vertically, or two squares away vertically and one square away horizontally. The complete move therefore looks like a letter L.)

Решение

---

Оригинал в Архива: blitz-en-all-task-final.pdf