Example_2AFPC
Spatial two-alternative forced-choice probabilistic switching task (2AFPC) is a common behavioral model for working memory and expectation. Here, we illustate a 2AFPC task in mice experiments. The schedule is show as figure below, and there is a little bit need to master script language when you fulfill it.
In the 2AFPC task, animals were required to initiate a trial by licking the central port, and sequentially move to a left or a right port to obtain a reward. Only one port was rewarded by 75% at a time. In 25% of trials, neither port was rewarded. If no reward was delivered, animals would be punished with an extra time out.
Only after the set amount of rewards (7-14 for each block) was obtained and the last outcome was a reward, the rewarded side could be switched to the opposite port.
To prevent mice from getting demotivated when rewards are successively missed, the max consecution of reward-missing were numerically limited to 2 trials.
The schedule can be decomposed to a form named State Machine (below).
A form of State Machine for Go/NoGo task. "Left Block" (C2, Component-2) and "Right Block" (C3) look alike to each other. The task will automatically stop (end/finish) when the animal run out of 200 drops of water.
The RED-COLORED notes are where you need to mannually code. Don't worry if you don't know how to code, the code here is really brief and easy.
The form can be fulfilled in ArControl Designer as figure below. This demo has been embeded in release version in ArControl Designer> File > Open in > twoAFPC, but needs to be resaved when you use it for the first time.
2AFPC schedule is decomposed with ArControl Designer.