{{ block content }} Guess #3:

Consider the following scenario:

Agents A complete Version A of the task, in which they count the number of times the letter 'A' appeared in the tables. Agents B complete Version B of the task, in which they count the number of times the letter 'B' appeared in the tables. After all agents complete the task, we randomly match each Agent A with one Agent B to form pairs.

Suppose there are 100 such pairs of agents as described above.


In how many pairs (out of the 100) do you think that the Agent B solves more correct tables than the Agent A?
Your guess is the number of pairs (out of 100) in which Agent B outperforms Agent A.
{{ formfield 'probability' label=''}}

How sure are you about your answer?
{{ formfield 'probability_confidence' label=''}}





Remember:

Agents A completed Version A of the task, in which they had to count the number of times the letter 'A' appeared in the tables.
Agents B completed Version B of the task, in which they had to count the number of times the letter 'B' appeared in the tables.

{{ endblock }} {{ block style }} {{ endblock }}