AQuA-RAT train #65900 · Algebra · Algebra word problems

Mark has to visit towns B and C in any order

Mark has to visit towns B and C in any order. The roads connecting these towns with his house are shown on the diagram. How many different routes can he take starting from A and returning to A, going through both B and C and not traveling any road twice on the same trip?

~8 minAnswer checked instantly

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

Stuck? A gentle nudge

No hints for this one.

Something off?

Workspace

Your answer

Checked against the answer in AQuA-RAT.