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

  • Context: High School 
  • Thread starter Thread starter westgrant88
  • Start date Start date
Click For Summary

Discussion Overview

The discussion revolves around calculating the number of distinct paths on a 5x5 chessboard, specifically moving from the lower left corner to the upper right corner while only allowing movements to the right or upwards. The focus includes both the specific case of the 5x5 board and a general formula applicable to nxn boards.

Discussion Character

  • Exploratory
  • Mathematical reasoning

Main Points Raised

  • One participant inquires about the existence of a formula for counting pathways on a chessboard, specifically for a 5x5 configuration.
  • Another participant explains that for an 8x8 board, the total number of moves consists of 7 moves to the right and 7 moves up, leading to a combinatorial calculation using binomial coefficients.
  • A formula for a generic nxn board is proposed, expressed as \(\binom{2n-2}{n-1}\), which represents the number of ways to arrange the moves.
  • A participant corrects their earlier mistake regarding the number of moves for the 5x5 board, acknowledging that it should be 4 moves up and 4 moves right instead of 7.

Areas of Agreement / Disagreement

There is a consensus on the correct number of moves for the 5x5 board being 4 up and 4 right. However, the discussion includes a mix of perspectives regarding the generalization of the formula and the initial confusion about the specific case.

Contextual Notes

The discussion does not resolve the application of the formula to the specific case of the 5x5 board, nor does it clarify any assumptions regarding the movement constraints or the interpretation of the problem.

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...
[tex]\displaystyle \binom{14}{7} = \frac{14!}{7!7!}[/tex]

For a generic nxn board it would be...

[tex]\displaystyle \binom{2n-2}{n-1} = \frac{(2n-2)!}{(n-1)!(n-1)!}[/tex]
 
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.
 

Similar threads

  • · Replies 23 ·
Replies
23
Views
4K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 8 ·
Replies
8
Views
2K
Replies
14
Views
3K
  • · Replies 1 ·
Replies
1
Views
724
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 83 ·
3
Replies
83
Views
22K
  • · Replies 13 ·
Replies
13
Views
4K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 4 ·
Replies
4
Views
4K