A simplified version of walking in hexes, how to improve?

Question

Informatics

Informatics for schools , the process of working in mblock and scratch

I solved the problem of walking on getks and refused to calculate the breadth first search and the dijkstra algorithm
But there is one problem .

As you can see, you can build a path without a complex algorithm

. The problem is, if the path is within a straight line, everything is fine. If it is not quite straight, then we have two squares.

How to solve this problem?

we have a sprite that does two things, numbers the cells and paves the way, the problem is that it still captures two cells at once, does anyone have any ideas how to avoid this?