The snake and the ladder 2

Computer Science Level 5

In a game of a snake and a ladder, the snake is to move exactly 35 steps. If the number of steps the snake takes at any point up the ladder is determined by a fair six-sided die such that if the number shown on the die is \(n\), the snake takes \(n\) steps up the ladder.

In how many ways can the snake reach its destination?

Inspired by The snake and a ladder.

Image Credit: Wikimedia Druyts.t.

Problem Loading...

Note Loading...

Set Loading...