Grid Meeting Before Corners

This probability question is about two random walkers on a finite grid whose moves are constrained by the boundary. It lives at the intersection of combinatorics and stochastic processes, where path counting, symmetry, and meeting events all interact. Because both walkers are driven by the same simple movement rules but in opposite directions, the setup hides strong structural relationships between their positions over time.

It trains core quant prep skills: discrete probability, lattice path combinatorics, and working with invariants under random evolution. You must translate a geometric story into coordinate dynamics, recognize which quantities stay controlled, and turn that into clean counting arguments. It also develops comfort with conditioning on events like boundary hits and meeting times.

This matters for quant interviews because it mimics real trading models where multiple agents evolve jointly under constraints. Interviewers learn how you discretize space and time, detect hidden structure, manage dependent random motions, and compute exact probabilities rather than rely on simulation. These are central abilities for market making, execution algorithms, and risk calculations, so mastering questions like this is crucial for strong performance in quant interviews and systematic trading roles.

What it tests

This class of problems is governed by the principle of path enumeration on a lattice, constrained by movement rules and boundary conditions. When two agents move in opposite directions on a grid, their meeting is only possible if their positions coincide both in space and in the number of steps taken. The key is to identify invariant quantities—such as the sum or difference of coordinates—that evolve predictably with each move. These invariants often restrict possible meeting points to specific lines or diagonals, and the number of ways to reach those points can be counted using combinatorial arguments, typically binomial coefficients. The probability of intersection is then the ratio of the number of successful meeting path pairs to the total number of independent path pairs.