This is part 3 of my series of talks on domino tilings of Aztec diamonds. I will describe an algorithm called "domino shuffling" due to Propp that will allow us to generate a random matching of an Aztec diamond graph according to any assignment of weights on the edges of the graph. After showing the algorithm in action with some examples, I will sketch out a proof that the algorithm works.