Tag Info

New answers tagged

4

It's possible to do this with AnyDice, if not particularly elegantly: function: test A:n and B:n and C:n and D:n { result: [sort {A, B, C, D}] = [sort {1, 2, 2, 5}] } output [test d6 and d6 and d6 and d6] (The first sort is there to normalize the order of the rolled dice, for order-insensitive comparison. The second one is there to make the code work ...


7

Probability for a special combination on nd6: If the sequences (1,2,3) and (1,3,2) are not the same - distingishable dice - then each sequence has the same probability of (1/6)^n where n gives the number of dice thrown. So P(1,2,3)=P(3,2,1)=P(2,3,1)=1/216. Or general P=(1/6)^n. If the sequences (1,2,2,3) and (2,1,2,3) are the same - undistingishable ...


9

Here's an AnyDice program to simulate it: function: test N:n against X:n reroll Y:n later Z:n { if N >= Y { result: 1 + [test d6 against X reroll Z later Z] } if N >= X { result: 1 } result: 0 } output [test d6 against 4 reroll 6 later 6] named "success on 4-6, reroll on 6" output [test d6 against 3 reroll 6 later 6] named "success on 3-6, ...



Top 50 recent answers are included