Multiple choice
In the CHSH nonlocal game, referees send Alice bit x and Bob bit y (each uniform in {0,1}); the players win if a XOR b = x AND y, where a, b are their answers. Using only deterministic classical strategies (no shared entanglement, no randomness needed since randomness cannot beat the best deterministic plan), what is the maximum probability of winning?