Rolling

Assignment:

1. Write a program that counts how many times three six-sided dice must be rolled until the values showing are all different.

2. DeMorgan’s laws will be useful here. You will need to extend the application of DeMorgan’s laws beyond a double exit scenario.

3. On paper, write down what will be true when the loop is done. Negate your assertion and you should have the loop boundary condition. Include your notes as documentation somewhere on your source code.

Instructions:

1. Include the output from two sample runs. One sample run should result in a count of 1, the other sample run should result in a count > 1. You might have to run your program a few times to get the second type of answer.

2. Here are two sample run outputs.

2 6 5
count = 1

5 3 5
3 5 3
3 3 4
1 3 3
2 5 4
count = 5