A diamond is a $4$-tournament which consists of a vertex dominating or dominated by a $3$-cycle. Assuming the existence of skew-conference matrices, we give a complete characterization of $n$-tournaments with the maximum number of diamonds when $n\equiv0\pmod{4}$ and $n\equiv3\pmod{4}$. For $n\equiv2\pmod{4}$, we obtain an upper bound on the number of diamonds in an $n$-tournament and we give a matricial characterization of tournaments achieving this bound.