This tutorial explores several classical strategies for attacking ("breaking") peaked quantum circuits, including sampling-based methods and the marginal attack. Using Statevector, MPS, and Pauli-Path simulators, we show how these techniques can recover the hidden peak bitstring for peaked circuits of moderate size, even when the circuits are designed to look random and hard to analyze. Along the way, we outline an elementary construction of peaked circuits and examine their robustness and the extent to which they are vulnerable to circuit "compression" attacks.