This short Note is a brief exposition of the basic modeling methodology of the dynamic-epistemic logic \(\textsf{DEL}\) and how it applies to the graph games with imperfect information considered in this book. It can be read as a prelude to the foundational chapter found in Part III of this book which offers an abstract analysis of the methodology of dynamic-epistemic recursion axioms in logics of information flow with fixed-point operators. We do not present a detailed didactic introduction to how \(\textsf{DEL}\) works, since there are excellent public sources for this.