 The modal formula \([\move_A]\langle \move_E\rangle \win_E\), true at root r, expresses that E has a strategy that ensures her a win in two steps: whatever A does, E can react in such a way that she ends up in a node where she wins. In a more fine-grained perspective, the modal language could add expressions \([a],[b]\ldots\) for specific move types \(a,b,\ldots\). In this language, the coarse-grained modality \(\langle \move_i\rangle \varphi\) is definable by the disjunction \(\bigvee_{a\text{ is a move for }i}\langle a \rangle\varphi\), making the new language a refinement of the old.