![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
There exists a city where all streets are exactly north-south or east-west. Because of that there are often many different routes from A to B with the same length.
The map below represents a part of this city. How many shortest routes are there from A to B?
Mark van Hoeij hoeij@sci.kun.nl
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |