This paper analyzes a simple symmetric random walk with finite steps in d-dimensional integer lattice, ℤ􀝀 and introduces one of its applications. It focuses on the total number of ways in which the walk can be accomplished. The number of ways of accomplishment is used to find the probabilities associated with all possible outcomes as a generalization of the probability associated with return to origin. In addition, the paper discusses on the total number of possible outcomes. (Since the walk is executed in ℤ􀝀 , all the outcomes are integer points.) It provides an insight into the distribution of the integer lattice, ℤ􀝀 .