In this paper we give a simple proof that the alternation-depthhierarchy of the μ-calculus for binary trees is strict.Thewitnesses for this strictness are the automata that determinewhether there is a winning strategy for the parity gameplayed on a tree.