This commit introduces a new probing algorithm for transfering the
solution to the requested re-sampled grid. The main features of the
algorithm are as follows:

(1) Use a previously found grid and its level as a starting point for the search otherwise,
start from level 0.

(2) Break from the main search loop as soon as possible. If a grid that satisfies the
query is found at level k, but not in level k+1, use the solution at level k and exit.
Note, this condition guarantees that at any level > k+1 we are not going to find a grid
that satisfies the given query.