Number of Paths on 5x5 Chessboard: Solve the Puzzle!

  • Thread starter Thread starter westgrant88
  • Start date Start date
AI Thread Summary
To solve the problem of finding the number of paths on a 5x5 chessboard from the lower left corner to the upper right corner, one can only move right or up. The correct calculation involves making 4 moves up and 4 moves right, totaling 8 moves. The number of distinct paths can be determined using the formula for combinations, specifically \(\binom{8}{4} = \frac{8!}{4!4!}\). For a generic nxn board, the formula is \(\binom{2n-2}{n-1} = \frac{(2n-2)!}{(n-1)!(n-1)!}\). This discussion clarifies the correct number of moves and the applicable formula for calculating the paths.
westgrant88
Messages
5
Reaction score
0
I know there is a formula for how many of a certain thing like squares on a 8x8 chessboard but I haven't come across anything on pathways .Is there one for this type of problem?Any help would be appreciated.
Consider a 5-by-5 chessboard. You want to move a nickel from the lower left corner to the upper right corner. You are only allowed to move the nickel one square at a time, and each move must be either to the right or up. How many different paths are possible?
Thanks
 
Mathematics news on Phys.org
For an 8x8 board...
If you can only move up or right, then that simplifies things considerably. Note that no matter which path you choose, you must move right 7 times and up 7 times, so we have 14 "moves" in total, no matter which path you choose. Basically, we have 14 slots and want to know how many ways there are to insert 7 ups and 7 rights into those slots. Really, we just want to know the number of ways to arrange 7 objects in 15 slots, since we then get the other 7 for free (just use the empty slots). The solution is then...
\displaystyle \binom{14}{7} = \frac{14!}{7!7!}

For a generic nxn board it would be...

\displaystyle \binom{2n-2}{n-1} = \frac{(2n-2)!}{(n-1)!(n-1)!}
 
Last edited:
never mind I didnt see the edit.
 
westgrant88 said:
Just wondering how you get 7 moves right and 7 up. Icount 4 and 4. How am I missing 3?

That's my bad; I did it for an 8x8. For a 5x5, you're right, it would be 4 moves up and 4 moves right.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Thread 'Imaginary Pythagorus'
I posted this in the Lame Math thread, but it's got me thinking. Is there any validity to this? Or is it really just a mathematical trick? Naively, I see that i2 + plus 12 does equal zero2. But does this have a meaning? I know one can treat the imaginary number line as just another axis like the reals, but does that mean this does represent a triangle in the complex plane with a hypotenuse of length zero? Ibix offered a rendering of the diagram using what I assume is matrix* notation...

Similar threads

Replies
23
Views
3K
Replies
8
Views
3K
Replies
64
Views
23K
Replies
4
Views
3K
Replies
5
Views
2K
2
Replies
80
Views
9K
2
Replies
83
Views
21K
Back
Top