Abstract
The author shows how to simulate random walks terminating on the periphery of a rectangle, both in the continuum and on a square lattice. The method is error-free in principle except for a negligible bias arising from the rejection of very long walks. The average machine time would be O(1) step in the modified procedure. This method may be useful in exploring the distinction between the continuum and the lattice in diffusion-limited aggregation.