# Quite A Knight

Discrete Mathematics Level 5

A knight stands on an infinitely large chess board, on a square with coordinates $$(0,0)$$. Through a sequence of valid knight's moves, it can reach square $$(22,18)$$.

Question 1: What is the minimum number of moves needed to accomplish this?

Question 2: How many different sequences of moves of minimum length accomplish this?

Report your answers by concatenating them. For instance, if there answer to question 1 is 83 and the answer to question 2 is 155, post the solution "83155".

×