  We show that for any fixed $\alpha>0$, cherry-quasirandom 3-graphs of
positive density and sufficiently large order $n$ with minimum vertex degree
$\alpha \binom n2$ have a tight Hamilton cycle. This solves a conjecture of
Aigner-Horev and Levy.
