perplexus.info :: Just Math : Going North-East

Going North-East (Posted on 2014-12-05)

On a 10x10 "chessboard" a token is placed on the leftmost square of the bottom line a.k.a. a1.
You can move said token either one step to the right or one step up within the same column or one step diagonally (combining right and up).
To make it clear from c4 you may advance in one step to c5, c6 or d6.

How many distinct routes exist to reach the top line's rightmost square (i.e. j10?

No Solution Yet Submitted by Ady TZIDON

No Rating

Comments: ( You must be logged in to post comments.)

Subject	Author	Date
re(2): Another way to avoid tedium.	Jer	2014-12-07 20:31:21
re: Another way to avoid tedium.	Charlie	2014-12-07 10:32:56
Another way to avoid tedium.	Jer	2014-12-06 21:41:37
solution: computer used, to avoid tedium	Charlie	2014-12-05 09:40:23

Please log in:

Login:
Password:
Remember me:

Sign up! \| Forgot password

Search:

Search body:

Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (21)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info