Pat will walk from intersection X to intersection Y along a route…

Pat will walk from intersection X to intersection Y along a route that is confined to the square grid of four streets and three avenues shown in the map above. How many routes from X to Y can Pat take that have the minimum possible length?

This problem refers to a figure in its source book that isn't reproduced here.

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