  In this work we continue our study of Fully Packed Loop (FPL) configurations
in a triangle. These are certain subgraphs on a triangular subset of the square
lattice, which first arose in the study of the usual FPL configurations on a
square grid. We show that, in a special case, the enumeration of these FPLs in
a triangle is given by Littlewood-Richardson coefficients. The proof consists
of a bijection with Knutson-Tao puzzles.
