Fewest moves across a grid when each move can jump up to k cells

On a grid with blocked cells, each move goes up, down, left or right by one to k cells, without passing through a blocked cell. Return the fewest moves from the start to the target, or -1. Start with plain BFS, then explain how to avoid re-scanning the same cells on every jump.