Counting Count the number of paths from S (start) to G (goal) that stays along the white roads. Paths cannot use the same road twice but may visit the same intersection twice. As an example, the pink path shows one valid path.
Expected difficulty Insane • Answer • Comment/E-mail if you want a solution to be published
Erm. You may use a calculator or a program. (If you managed to program the solution, then you deserve the answer. I’m not responsible if you miscalculate when you’re multiplying large numbers by hand.)
This is a rejected puzzle of a set born out of a stupid idea. Why did I even think of this? The good news is I have a free Brilliant.org problem idea, and I can practice my programming skills.