The Quantified constraint satisfaction problem (QCSP) has been introduced to express situations in which we are not able to de- cide the value of some of the variables (the universal ones). Despite the expressiveness of QCSP, many problems, such as two-player games or motion planning of robots, remain difficult to express. In this paper, we propose Strategic CSP, an extension of QCSP where universal vari- ables adapt their domain to be compatible with previous choices. This new framework permits an easy encoding of many two-player games. We give examples of such encodings and provide a preliminary experimental evaluation.