Imagine that each grid point (x,y) has a "value" 2^-(x+y).
The original 3 stones cover points of total value 2.
Each move preserves total value.
The entire grid has total value 4 (geometric series).
So if the original 3 points were empty, all the other points would have to be covered. You can't do this in a finite sequence of moves.