WALKS IN THE PLANE FROM (0,0) TO (N,N) ------------------------------------ This paper is concerned with walks from (0,0) to (N,N) where steps from some subset of, {[0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]}, are allowed. Given a nonempty subset E of, {[0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]}, define the generating function f(N,E;t):=sum t^a(w), where w ranges over walks from (0,0)->(N,N) with steps taken from E, and a is the statistic which counts the number of times a walk visits {y