Path Counting - Chances of two people meeting?

Click For Summary
SUMMARY

The discussion focuses on calculating the probability of two individuals, Jeanine and Miguel, meeting while walking towards each other in a grid-like street network. The problem involves determining the number of paths they can take to meet at specific corners after a set number of moves, utilizing Pascal's Triangle for combinatorial calculations. The solution for a 1 by 1, 2 by 2, and 3 by 3 grid is explored, with the final probability of them meeting calculated as 35/128 after analyzing their potential routes.

PREREQUISITES
  • Understanding of combinatorial mathematics
  • Familiarity with Pascal's Triangle
  • Basic knowledge of probability theory
  • Concept of grid-based movement
NEXT STEPS
  • Study combinatorial path counting techniques
  • Learn how to apply Pascal's Triangle in probability problems
  • Explore grid movement algorithms in discrete mathematics
  • Investigate advanced probability concepts related to random walks
USEFUL FOR

Mathematics students, educators, and anyone interested in probability theory and combinatorial analysis, particularly in the context of pathfinding problems.

phono
Messages
3
Reaction score
0

Homework Statement



I am having trouble with this problem.

A network of city streets forms square bloacks as shown in the diagram below.
http://img182.imageshack.us/my.php?image=librarypoolqs6.jpg

Jeanine leaves the library and walks toward the pool at the same time as Miguel leaves the pools and walks toward the lbrary. Neither person follows a particular route, except that both are always moving toward their destination. What is the probability that they will meet if they both walk at the same rate?

In addition, how would I solve this for a 1 by 1 grid, 2 by 2 grid, 3 by 3 grid,etc.?

I know that you have to use Pascal's Triangle and I think that they would have to meet on their "4th" moves. The answer in the book is 35/128 but I don't know how to get this.
 
Last edited:
Physics news on Phys.org
First figure out which corners can be reached in 4 moves. Then figure out the number of ways to reach each of those corners (this is where Pascal's triangle comes in). Now figure out the probability that each walker will land at a given corner and add them up.
 

Similar threads

  • · Replies 5 ·
Replies
5
Views
5K
  • · Replies 92 ·
4
Replies
92
Views
14K
  • · Replies 19 ·
Replies
19
Views
6K
Replies
5
Views
3K
  • · Replies 12 ·
Replies
12
Views
7K
  • · Replies 11 ·
Replies
11
Views
6K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 2 ·
Replies
2
Views
485
  • · Replies 6 ·
Replies
6
Views
7K
  • · Replies 9 ·
Replies
9
Views
6K