You can have an array deg[i][j] = count of adjacent unvisited cells for cell (i;j).

While doing DFS sort edges by non-decreasing deg[i+move. first] [j+move. second].

It calls an heuristic after some scientist whose name begins at W.