The method of switchings is a combinatorial technique pioneered by Brendan McKay and Nicolas Wormald for approximate counting. Stein's method is a technique developed by Charles Stein to prove that a sequence of probability distributions converges to a limit. After short introductions to both techniques, I'll explain how to view the first technique as an application of the second. This lets us prove a new result on random regular graphs.