Yes that's why I'm asking for an algorithmic solution
you would need to sample an array without replacement
1 Like
I will have dan work on this.
What. The. Fuck.
1 Like
Just do a randomize table in google sheets
I know. A lot to wrap the mind around, especially for a card game developer
I think i can implement this in Go
In any case i am fine with nmaganes plan. I think we should.make sure everyone else is on board.
Just roll the dice until you get all of the numbers rolled and then mark the first one to show up as the order they arrive in and then discard the duplicates. Why do you have to make things so complicated?
1 Like
Yessss
Stove you have to make a choice
Do you prefer to be voted for daykill or do you want to be shot with day action
Cuz one or the other is happening
1 Like
You don't have a mandate and nobody voted for you be in charge.
With that said I prefer to be lynched because I feel like it would be more enjoyable than being shot which would be fast and boring.
Ok so we do reverse order and then the survivors vote stove
Game is solved
But I won't be because we should just follow my list waves hand and accept my republican credits
This unfortunately changes the math to an inverse game show problem.
Your list is bad because u proposed it and ur alive
U stay alive*
Our chance of winning goes from
1 - e^(-x) to e^(-x)
Another thing, once you roll all of the numbers except the last number you can even optimize and not have to keep rolling until you get the last number because you can infer which number will be last place. Clever.
So if you have a 100 side die and rolled 99 numbers, instead of rolling until the 100th number shows up, save yourself the time and fill in that 100th number in last place.