You need to detect a mine in a 8x8 square.
A mine is detected in the small square at the current location, and in the cells that have a common side with the current location.
You start in a corner square, and move to a square that is a neighbor by common side. (Diagonal moves, and diagonal mine detections, are not allowed.)
How many moves do you make?
Find the least possible number.
Inspired by an Olympiad problem of Mikhail Evdokimov