Assume you have an object moving at a constant velocity(up, down, left, right) in a grid. You have unlimited resources (memory, time). At any given time step in the grid, you can guess the location of the object, and you win if it is currently at that position. Without relying on probability techniques, what would be the best way to approach catching this object?
finding a an object with constant velocity on an infinite grid in discrete time steps
algorithms;search algorithms;probabilistic algorithms