  In this paper we examine the rate of convergence of one of the standard
algorithms for emulating exit probabilities of Brownian motion, the Walk on
Spheres (WoS) algorithm. We obtain the complete characterization of the rate of
convergence of WoS in terms of the local geomnetry of a domain.
