Given a finite set of integer vectors, S, we consider the set of all lattice walks comprised as ordered sequences of steps whose directions come from S. We further restrict our attention to walks of minimal length, meaning they cannot be shortened through some linear combination of allowable steps from S. We consider the problem of counting the number of such minimal walks terminating at a fixed point (a,b) for various choices of the set S.