In a maze you must get from A to B by travelling along segments. How many different paths can be found?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
We have two ways to choose: three ↓ s and five → s
So there are 3 ! 5 ! 8 ! = 5 6 different paths.