There are two players, False and True, who take turns. A legal move for False consists of replacing all occurences of one atom with 'false' and you can guess what True's moves are. True wins if the expression evaluates to 'true' with the obvious interpretation of the symbols I've given and False wins if the expression evaluates to false. There is no possibility of a tie.
For example consider the game (A+B)(C+D)(E+F). This is a win for True whoever plays next. Any time False sets an atom to 'false' True merely has to set the other atom in the same factor to 'true' making the factor 'true'. Eventually all of the factors will have the value 'true'.
So here are some questions:
- Has this game already been studied? If so, what's it called?
- Is there a nice way to evaluate any position in the game? A partial answer is given by some papers by Anshelevich on the subject of Hex. All Hex positions are positions in this game and many interesting Hex positions and subproblems can be approximated well by simple positions in this game. (Note that a good strategy for this game might not be a good strategy for Hex because a Hex game corresponds to a very large expression.)
- Can you assign Conway numbers to positions in this game? What is the value of 'true'?
- What happens if you allow the unary operator 'not' and allow the two players to replace an atom with either 'true' or 'false'.
- What other games, besides Hex, are special cases of this game? (All combinatorial games I guess.) What games are special cases in an interesting way?