{% extends "global/Page.html" %} {% load otree %} {% load staticfiles %} {% block title %} Third stage {% endblock %} {% block content %}

In each task, a matrix will be displayed. Each matrix consists of small squares of numbers. Your job is to count how many times 1 is entered alone in a square. Below is an example.

The correct answer is 53. You do not count squares where 1 is entered twice.

Then, there will be a box in which you will enter the correct answer. After that, you will proceed to the next page which will inform you if your answer is correct or not. If it is correct, you proceed to the next task. If it is incorrect, you get a warning. If you only have one warning, you proceed to the next task. Once you get a second warning, the experiment will be abruptly stopped, and you will not receive the reward for which you are competing. That is why you are strongly advised to double check your answer before submitting it.

Please, proceed to the next section to choose the maximum number of tasks you would do for different amounts of money.

{% next_button %} {% endblock %}