{
"INSTINTRO": "<b>Traveling Salesman Problem Task</b><br>In this test, your goal is to draw a path through all of the points on the screen on the shortest path possible, returning to your starting point.<br>Start at the <b>grey circle</b>, move through each point by <b><INPUT>ing</b> on it, and make sure you return to the first point at the very end.<br>We will start with a sample trial. Remember, you don't need to <INPUT> the first grey circle.<br><p align=center>Now, <INPUT> <b>Continue</b> to start the example.</p>",

"INSTNOINTRO": "<b>Traveling Salesman Problem Task</b><br>In this test, your goal is to draw a path through all of the points on the screen on the shortest path possible, returning to your starting point.<br>Start at the <b>grey circle</b>, move through each point by <b><INPUT>ing</b> on it, and make sure you return to the first point at the very end.<br><p align=center>Now, <INPUT> <b>Continue</b> to begin.</p>",

"CONTINUE": "Continue",

"BACKUP": "Backup",

"INST2": " each circle, connecting the dots and finding the shortest path through all the points. Your path starts on the grey point--<INPUT> a red point to begin.",

"INST3": "Great! The feedback shows you the best path through the points, and how much worse you did than the shortest possible route.<br>If you score an <b>efficiency value of 1.0</b>, you found the shortest possible route.<br>Now, try a few more practice tests.<br><p align=center><INPUT> <b>Continue</b> to begin.</p>",

"INST4": "Work through each sample problem, trying to find the most efficient path.",

"INST5": "Now, you will solve some more difficult problems.<br>You probably won't find the shortest path, but do as good of a job as you can.<br>Remember, we are measuring <b>BOTH</b> how efficient your path is and how fast you solve the problem, so try to be both <b>fast and efficient</b>.<br><p align=center><INPUT> <b>Continue</b> to begin.</p>",

"EXIT": "Exit",

"DEBRIEF": "<b>Test Complete</b><br>This test is complete.<br><p align=center>Click <b>Exit</b> to continue.</p>",

"POPUP": "<b>Route Complete!</b><br>Efficiency: <b><EFF></b> (<PCT>% longer than optimal)<br>Your goal is to have a low efficiency value (1.0 is the smallest it can get).<br>The <b>green line</b> shows the best solution.<br><p align=center>Click to continue</p>",

"PERFORMANCE_HEADER": "Your Performance",

"PERFORMANCE_COLUMNS": "Condition   Trials   Time (s)   Effic.   # Perfect",

"PERFORMANCE_DIVIDER": "-----------------------------------------------",

"ROUTE_STATS": "<b>Route Complete:</b><br>Optimal Path Distance:   [<OPT>]<br>Observed Path Distance:  [<OBS>]<br>Overall Inefficiency:    [<EFF>]<br>Time:                    [<TIME> sec]",

"REPORT_HEADER": "PEBL TSP Task",

"REPORT_URL": "http://pebl.sf.net",

"REPORT_VERSION": "Using PEBL Version:",

"REPORT_PARTICIPANT": "Participant code:",

"REPORT_DIVIDER": "-----------------------------------",

"UPLOAD_MSG": "Uploading data files..."
}
