Solving the shortest path task.

<p><b>A:</b> Two instances of MF dynamics from a network storing two correlated maps, during the presentation of two angles () with an intervening delay. The network operates in the cylinder regime. The plot shows the time course of the order parameter ; : pre-stimulus period, random starting , no tuned input. : first stimulus (presented in map , at (solid and dashed). : delay period, no tuned input. : second stimulus (solid) and (dashed). By looking at the position of the bump in () during the second stimulus presentation, it is possible to decide whether the shortest path between the first and second stimulus is CW () or CCW (). <b>B:</b> Sequential repetition of the task, trials. The location of the bump maximum along is plotted the oriented distance on the circle between the second and the first stimulus. Parameters .