One More Technique for the Dimer Problem

The problem of counting the dimer coverings of a square lattice is recast as a counting of coverings by oriented closed loops. Thus the answer is expressed as the value of a suitable permanent. This permanent is transformed to a determinant, which on evaluation recovers the familiar result.