Path Counting

Computer Science Level 3

Compute the number of paths from S (start) to G (goal) in the following image, without using any road twice (but may visit an intersection twice). As an explicit example, the path in pink is one valid path.

Clarifications:

A road is a segment between two intersections that doesn't include any other intersection. A path is a connected sequence of roads from start to goal.

Excel in math and science

Master concepts by solving fun, challenging problems.

It's hard to learn from lectures and videos

Learn more effectively through short, conceptual quizzes.

Our wiki is made for math and science

Master advanced concepts through explanations, examples, and problems from the community.

Used and loved by 4 million people

Learn from a vibrant community of students and enthusiasts, including olympiad champions, researchers, and professionals.