Scenario, I want to play a game with a group of students as a teacher, I ask two teachers to help.
The students are from the central classroom, going to room A and room B where the teachers there asks the students question 1 or 2. So A1, A2 are the possible questions to ask students who are in room A, B1, B2 are the possible questions for students in room B.
The answers the students give, I use lowercase, a1, a2, b1, b2, it can only be either 1 or -1. The goal of the student is to try to violate CHSH inequality, we introduce to the |S|= | average of (a1b1) + average of (a1b2) + average of (a2b1)− average of (a2b2)| and violation means getting |S| to be more than 2.
We impose locality by no communication between room A and room B.
We impose counterfactual definiteness by asking the students not to randomly give the answer on the spot, but have it ready for all possible questions they are asked (only 2 possible questions for each student). They are free to decide the correlation (hidden variables), eg. they synchronise their watches, and answer 1 if the minute hand is pointing to even number, and answer -1 if the minute hand is pointing to odd number.
We impose freedom of choice of the experimenter, by allowing the teachers to choose whatever questions they wish to ask and the students do not know which of the 2 questions in each of the 2 rooms will be asked.
I can see easily how relaxing locality (to allow them phones), or freedom (to give them beforehand the questions the teachers in both rooms will ask) allows them to get S to become 4.
But I cannot see how only relaxing counterfactual definiteness (allowing them to guess the answer on the spot), but retaining locality and freedom allows the students to violate CHSH.
So for each pair of students going out, the one going into room A only have to answer 1, whatever the question is. The one going to the room B has to answer 1, except if they got the question B2 and if they know that the question A2 is going to be asked of student in room A The main difficulty is, how would student B know what question student A got? They are too far apart, communication is not allowed. They cannot know the exact order questions they are going to get beforehand.
Say if students who go into room B decide to go for random answering if they got the question B2, on the faint hope that enough of the answer -1 will coincide with the question A2. We expect 50% of it will, and 50% of it will not.
So let’s look at the statistics.
Average of (a1b1) = 1
Average of (a2b1) = 1
Average of (a1b2) = 0
Average of (a2b2) = 0
S=2
Average of (a1b2) and Average of (a2b2) are both zero because while a always are 1, b2 take turns to alternate between 1 and -1, so it averages out to zero. Mere allowing for randomisation and denying counterfactual definiteness no longer works
Anything I am missing? Or is it not suitable to cast this as a game to be played by human students in class?