Knight's Moves

A knight moves on an infinite grid. It starts at the point (0,0) and must reach
the point (5,27). Assuming it moves in the smallest number of steps required,
how many different possibilities does it have to reach this point?

Difficulty level (1 very easy - 10 very hard): 3

Topics:
Combinatorics -> Combinatorial Geometry -> Grid Paper Geometry / Lattice Geometry
Sources:
There are no comments yet.
Authentication required

You must log in to post a comment.

Log in