Morris Mouse can find his way through the maze easily from entrance A to exit B. However, he receives food only if he finds the exit without going west or south. (North is towards the top of the diagram.) How many different paths can he take through the maze to receive food? (Note: Different paths have at least one distinct section. See the diagram for an example.)

Question

anonymous · Answer

how to solve the above question?

turingtest · Answer

having the diagram would be nice