Load Supporting Files
Condition 1 URL Select An Uploaded File
Condition 1 Short Name
Condition 2 URL Select An Uploaded File
Condition 2 Short Name
Viewer Width
Viewer Height
Select the Dataset for the study Select One IMDB - small Les Miserables Receipe - small
Select Experiment Type Select One Within Between
Task Type 1 Select a Task Are the two highlighted nodes directly connected? Can you get from one of the highlighted nodes to the other with exactly 2 steps? Are the three highlighted nodes directly connected? Can you get from one of the highlighted nodes to the other in at most 3 steps? How many nodes can be reached in one step from the highlighted node? What is the maximum number of nodes connected to one of the two highlighted nodes? Is there an adjacent node that contains the letter B? How many adjacent nodes contain the letter B? Find the number of nodes on a given path starting with a letter Find the number of nodes starting with a letter on all paths between 2 nodes Select the most connected node Given the two highlighted nodes, select the one with the highest degree
Number of Task Type 1 Questions
Time In Seconds for Task Type 1 (Enter 0 for unlimited)
Specify number of training questions
AWS Access Key
AWS Secret Key
HIT Title
Number of Assignments
Reward