A traveller, starting from town No. 1, wishes to visit every one of the towns once, and once only, going only by roads indicated by straight lines. 

How many different routes are there from which he can select? 

He must end his journey at No. 1, from which he started, and must take no notice of cross roads, but go straight from town to town. 

See answer

Math Genius