I believe the idea here is that because particle A and B are indistinguishable, the probability assigned to the case where particle A is "before" B can be equivalently assigned to the opposite case.

In the same manner that a train schedule with cities across the top and side needs only one entry per cityA / cityB pairing.