In the talk I will explain the notions of alternating tree automata and parity games and, after a short review of mu calculus, demonstrate how intimate the connections between these notions and mu-calculus are. The focus will be on algorithmic rather than model-theoretic aspects of mu calculus.