MathDB
giraffe chess piece

Source: 2016 Chile National Olympiad level 2 p3

October 22, 2022
combinatorics

Problem Statement

The giraffe is a chess piece that moves 44 squares in one direction and then a box in a perpendicular direction. What is the smallest value of nn such that the giraffe that starts from a corner on an n×nn \times n board can visit all the squares of said board?