Abstract
The Russian Cards Problem is a toy model of safe communication via an open channel. It has been widely discussed in the literature, some of the recent approaches employ the apparatus of dynamic epistemic logic and represent communication of players by public announcements.
In this article we propose a solution which adds questions to players communication toolkit. We compare it to the solutions using public announcements and provide some complexity bounds.