N! Possible Routes is an extension of a very basic question: “What’s the quickest way to get there?”. Using web technologies, a bit of math and a lot of computer processing N! Possible Routes takes regions of the worlds and tries to find out all the possible ways to go between several places. Then, it lets users try to find the quickest (or slowest) way around and provides duration and distance information for every single route.
Instead of providing the user with the answer to this question, the project provides a way for the user to find out for himself. The question turns into a game of finding out the quickest route between several places.