Find the least number of moves required.

Question

A move of a coin is defined as crossing any number of points in a straight line on the $4 \times 4$ grid (horizontally,vertically or diagonally). What is the lest number of moves in which a coin, starting from the indicated position, can cover all nine points within the marked square?

I did it in $5$ moves. The way I did it is as follows $:$

Is it the optimal one or there are more efficient moves exist? Any help regarding this will be appreciated.

Thanks for your time.

EDIT $:$ MY RE-ATTEMPT $:$

Answer 1

This is a classic puzzle. It can be done in 4 moves. From your marked starting position: Down 2; diagonal up/right 3; left 3; diagonal down/right 2 (or 3)