I will pick up where I left off last time, starting with a quick review of the algorithm for computing the sum of weighted matchings of the Aztec diamond graph, and then moving onto deriving a generating function for the edge-inclusion probabilities. If time permits, I will discuss generalizing this approach to other tiling problems, such as diabolo tilings of fortresses.