2019 OIM Problems/Problem 5
Problem
Don Miguel places a game piece on one of the 
vertices defined by a 
board. A move consists of moving the piece from the vertex where it is located at an adjacent vertex in one of the eight possible directions: 
as long as it does not go off the board. A tour is a sequence of moves such that the game pieces has been at each of the vertices exactly only once. What is the greatest number of diagonal moves (
) that you can have in a tour?
~translated into English by Tomas Diaz. ~orders@tomasdiaz.com
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
