Consider 6 points, two of which are A and B, such that…

Consider 6 points, two of which are A and B, such that each pair of points is connected by a line segment and no three points are collinear. Compute the number of distinct paths from A to B such that no point is visited more than once.

AQuA-RAT — Algebra Question Answering with Rationales (Ling et al., DeepMind, 2017) · train #94965