Sunday August 29, 2010
A turtle can move only in unit lengths along a grid in the right and downwards directions.
How many unique paths from the top left to the bottom right exist in a 40x40 grid?

Further applications:
For an additional challenge, how many unique paths exist if the turtle can move up, down, left, and right? The turtle may cross the same vertex, but it may not travel the same segment more than once.
Show solution
©1994-2022   |   Shodor   |   Privacy Policy   |   NSDL   |   XSEDE   |   Blue Waters   |   ACM SIGHPC   |   feedback  |   facebook   |   twitter   |   rss   |   youtube   |   XSEDE Code of Conduct   |   Not Logged In. Login