In the popular board game, Risk, players try to occupy as much territory as possible by moving around their armies and attacking territory owned by other players. These battles are settled through a series of dice rolls.

The attacker rolls up to three dice, while the defender only rolls two. First, the highest values rolled by each player are compared. If the attacker rolled a higher value, the defender loses a unit. Otherwise, the attacker loses a unit. Then, the second highest values are compared in the same manner and one of the players loses a unit. This goes on until one of the armies becomes depleted.

If the attacker has fewer than three units, he may only roll the same number of dice as the number of units. Likewise, if the defender has fewer the two units, he may only roll one die.

1) What is the probability that a dice roll results in a draw?

Okay, so now pretend there is a battle where the attacker has n units, and the defender has m units.

2) What is the probability that the attacker wins the exchange?

3) What is the average/best/worst case running time of the entire exchange?

## Question

## gavinksong

In the popular board game, Risk, players try to occupy as much territory as possible by moving around their armies and attacking territory owned by other players. These battles are settled through a series of dice rolls.

The attacker rolls up to three dice, while the defender only rolls two. First, the highest values rolled by each player are compared. If the attacker rolled a higher value, the defender loses a unit. Otherwise, the attacker loses a unit. Then, the second highest values are compared in the same manner and one of the players loses a unit. This goes on until one of the armies becomes depleted.

If the attacker has fewer than three units, he may only roll the same number of dice as the number of units. Likewise, if the defender has fewer the two units, he may only roll one die.

1) What is the probability that a dice roll results in a draw?

Okay, so now pretend there is a battle where the attacker has n units, and the defender has m units.

2) What is the probability that the attacker wins the exchange?

3) What is the average/best/worst case running time of the entire exchange?

## Link to comment

## Share on other sites

## 3 answers to this question

## Recommended Posts

## Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.