  We shift the QCSP (Quantified Constraint Satisfaction Problems) framework to
the QCHR (Quantified Constraint Handling Rules) framework by enabling dynamic
binder and access to user-defined constraints. QCSP offers a natural framework
to express PSPACE problems as finite two-players games. But to define a QCSP
model, the binder must be formerly known and cannot be built dynamically even
if the worst case won't occur. To overcome this issue, we define the new QCHR
formalism that allows to build the binder dynamically during the solving. Our
QCHR models exhibit state-of-the-art performances on static binder and
outperforms previous QCSP approaches when the binder is dynamic.
