Through B, Around the Closed Road

Difficulty: Hard · Topics: Discrete Mathematics, Combinations, Paths

A walker starts at A and moves only right or down along the streets to reach C. The street between D and E is closed.

graph "x":[-0.7,5.7],"y":[-0.7,5.7],"axes":false,"ink":true,"label":"A 5 by 5 street grid from A (top left) to C (bottom right); B is marked and the street from D to E is closed","items":["type":"line","from":[0,0],"to":[5,0],"ink":true,"width":1.2,"type":"line","from":[0,1],"to":[5,1],"ink":true,"width":1.2,"type":"line","from":[0,2],"to":[5,2],"ink":true,"width":1.2,"type":"line","from":[0,3],"to":[5,3],"ink":true,"width":1.2,"type":"line","from":[0,4],"to":[5,4],"ink":true,"width":1.2,"type":"line","from":[0,5],"to":[5,5],"ink":true,"width":1.2,"type":"line","from":[0,0],"to":[0,5],"ink":true,"width":1.2,"type":"line","from":[1,0],"to":[1,5],"ink":true,"width":1.2,"type":"line","from":[2,0],"to":[2,5],"ink":true,"width":1.2,"type":"line","from":[3,0],"to":[3,5],"ink":true,"width":1.2,"type":"line","from":[4,0],"to":[4,5],"ink":true,"width":1.2,"type":"line","from":[5,0],"to":[5,5],"ink":true,"width":1.2,"type":"line","from":[2,2],"to":[3,2],"ink":false,"width":5,"dash":true,"type":"line","from":[2.36,1.8599999999999999],"to":[2.64,2.14],"ink":false,"width":3,"type":"line","from":[2.36,2.14],"to":[2.64,1.8599999999999999],"ink":false,"width":3,"type":"point","at":[0,5],"label":"A","anchor":"nw","ink":true,"type":"point","at":[2,3],"label":"B","anchor":"nw","ink":true,"type":"point","at":[2,2],"label":"D","anchor":"sw","ink":true,"type":"point","at":[3,2],"label":"E","anchor":"se","ink":true,"type":"point","at":[5,0],"label":"C","anchor":"se","ink":true]

In how many different ways can the walker go from A to C while passing through B?