  In this note, we give a short proof that knot Floer thickness is a lower
bound on the dealternating number of a knot. The result is originally due to
work of Abe and Kishimoto, Lowrance, and Turaev. Our proof is a modification of
the Stipsicz-Szabo approach using Kauffman states to show that thickness bounds
the minimal number of bad domains in a knot diagram.
