Monotone grid paths hitting at least one power-up
Question
On a board a character starts at cell and must reach , moving one cell at a time either down or to the right. Bonus items sit on cells and . How many routes pass through at least one of the bonus cells?
Short answer
. Use inclusion-exclusion: routes through number , routes through number , and routes through both number . So .
Adapted from OpenQuant; question and answer rewritten by SelfMadeQuant.com.
See the hint and the full worked solution in the question bank (free account).
Open the worked solutionLessons behind this question
Start with a free lesson: Probability Fundamentals is part of a free topic. Create a free account, no card needed, to read it in full with worked solutions.
Read it free