RSSAha! Puzzle This
Cheesecake Solution
This problem is easiest solved backwards. If we start with a 1x1 square, there are only 2 paths.
From that point, there are 2 other points to go to and both of them only have 1 path to the end, so the number of paths from any given point is just the sum of the paths from the points you would visit next.
Moving back, you can see that there are 3 paths from the point directly to the left.
If we fill in all the values by summing the 2 options from the point one to the right and the point one down, we can build up our matrix until we arrive at the solution.
The total solution comes out to 12,870 paths.
Downloads & Extras
All the stuff you need to build the projects in MAKE, and exclusive online features direct from the staff of MAKE.
Volume 29» Volume 28» Volume 27»
Connect with Make
EMAIL MAKE's editors
TWITTER MAKE feed
FACEBOOK MAKE page
FLICKR MAKE photo pool
RSS MAKE feed
YOUTUBE MAKE channel
Other Issues
Current Discussions
Join the conversation - many MAKE articles have an online page that includes a place for discussion.
Zombie Attack! -- Zombie Survival Science Fair
Awesome, Ian! Can't wait to see what you come up with! ...
Zombie Attack! -- Zombie Survival Science Fair
Hi, Im Ian and I have been looking in all the make magazines I have for an idea for my grade 9 scien...
Solar Pendulum -- Solar pendulum
Hi Marc,
The circuit is essentially just a switch which is triggered by the current induced when ...
Solar Pendulum -- Solar pendulum
Hi there,
Nice project. Just a couple of questions about this circuit. I'm new to electronics...
The Luna Mod -- Minor typo in the schematic
Thanks for your sharp eyes! We just posted a corrected schematic above....
A How-to Projects Community for Makers
All You Need to Get Started with Arduino & More!
