abstract: Development of efficient methods to compute a variety of quantities from first-passage probabilities and number of distinct lattice points visited to encounter times, coverage time, etc., have been hampered by the lack of an analytic representation of a discrete time propagator for random walks in confined lattice. I have resolved this difficulty by deriving the space-time discrete propagator for a random walk in confined domains in any dimension. I will show the derivation and present a few applications of the theory.