Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Q&A

What does the distribution of a strictly increasing random walk look like if you stop at `N` steps?

+3
−0

I have a puzzle inspired by the game Idle Brick Breaker (Google Play and App Store)

Say you have a d100, and if you roll a 100, you advance 50 steps (or S), if you roll 1 to 19 (or D), you advance 2 steps, and every other roll is 1 step.

After 1 million steps (or N steps), or exceeding N, you look back and see how many steps you "skipped" over in the process.

If you had the distribution of all possible ways you could roll, stopping after you reach or exceed 1 million, what is the mean of this distribution? What does it look like? How does it change with varying S, D, and N?

Put another way, what does the distribution of a strictly increasing random walk look like if you stop at N steps?

History
Why does this post require moderator attention?
You might want to add some details to your flag.
Why should this post be closed?

1 comment thread

CLT (1 comment)

0 answers

Sign up to answer this question »