{% load otree static %} {% block content %}

Your work today

In the first part of this experiment, you have already tried out some transcription sequences. In the third part of the study you will have to complete a transcription task consisting of a certain number of these sequences: {{Constants.base_tasks}} plus the additional sequences that have been assigned to you.

As the number you have to solve in the end might be high, you can now choose to already complete some of the sequences today. The maximum number of sequences you can already solve today is {{Constants.base_tasks}}.

{% formfield player.num_tasks_today label='Here, please type in the number of sequences you want to solve today:' %}

Click "next" if you are ready to start.


You have to transcribe sequence of {{ num_letters }} numbers into a sequences of {{ num_letters }} letters. To do this, an input field is displayed below the sequence of numbers. Here is an example:

{% for num in display_numbers %} {% endfor %} {% for char in display_chars %} {% endfor %}
Number:{{ num }}
Letter:{{ char }}

Your task is to find the corresponding letter for each number and enter the resulting sequence of letters in the input field. Do not enter any spaces between the letters in the input field. Note also, the input field is not case-sensitive. That is, it does not matter whether you enter for example “k” or “K”.

In the above example you are seeing the sequence {{ number_string }}. Given this coding key, the solution is the letter sequence {{ solution }}. For this example, we have entered this solution for you in the input field.

{{ number_string }}

Once you submit a correct code, the computer will prompt you with another sequence.

In case you submit an incorrect code, you will be notified by the computer and have to redo the sequence. To complete the task, you have to transcribe a certain number of sequences. From sequence to sequence, both the number sequence and the coding key change.


{% next_button %}

{% endblock %}