The structure of interaction plays an important role in the outcome of evolutionary games. This study investigates the evolution of stochastic strategies of the prisoner's dilemma played on structures ranging from lattices to small world networks. Strategies and payoffs are analyzed as a function of the network characteristics of the node they are playing on. Nodes with lattice-like neighborhoods tend to perform better than the nodes modified during the rewiring process of the construction of the small-world network.