Expected Winnings from Alternating Random Walks Around a Circle

Quick Overview

Find expected winnings on an odd circular random walk using first-hit parity, gambler’s-ruin probabilities, and linearity of expectation across stones.

Expected Winnings from Alternating Random Walks Around a Circle

Company: DRW

Role: Quantitative Researcher

Category: Statistics & Math

Difficulty: medium

Interview Round: Online Assessment

Forty-five stones form a circle, each containing \$100. You choose a starting stone uniformly, collect its money, and place a token there. Your opponent moves first, then you alternate turns. Each move is one stone clockwise or counterclockwise with equal probability, collecting any money remaining at the destination. Play ends after all money has been collected. What is your expected total, including the initial \$100? ### Clarifying Questions to Ask - Is a stone paid only on its first visit? - Does your opponent take odd-numbered moves and you take even-numbered moves? ```hint Study one target stone The player collecting a stone is determined by the parity of its first hitting time. Unwrap the circle into an interval with two absorbing copies of that target. ``` ### What a Strong Answer Covers - Linearity of expectation over first-visited stones. - Gambler's-ruin probabilities for reaching the target from either direction. - The parity difference created by an odd-sized circle. ### Follow-up Questions - What changes if the circle contains an even number of stones? - Why is independence between different stones' collection events unnecessary?

Overview: Find expected winnings on an odd circular random walk using first-hit parity, gambler’s-ruin probabilities, and linearity of expectation across stones.

Read the full DRW Quantitative Researcher interview experience this question came from

DRW logo
DRW
Nov 21, 2026
mediumQuantitative ResearcherOnline AssessmentStatistics & Math
0
0

Forty-five stones form a circle, each containing $100. You choose a starting stone uniformly, collect its money, and place a token there. Your opponent moves first, then you alternate turns. Each move is one stone clockwise or counterclockwise with equal probability, collecting any money remaining at the destination. Play ends after all money has been collected. What is your expected total, including the initial $100?

Clarifying Questions to Ask Guidance

  • Is a stone paid only on its first visit?
  • Does your opponent take odd-numbered moves and you take even-numbered moves?

What a Strong Answer Covers Guidance

  • Linearity of expectation over first-visited stones.
  • Gambler's-ruin probabilities for reaching the target from either direction.
  • The parity difference created by an odd-sized circle.

Follow-up Questions Guidance

  • What changes if the circle contains an even number of stones?
  • Why is independence between different stones' collection events unnecessary?