I am new here because we got stuck with a question during the weekend's discussion.
Let's imagine we are playing a dice game. You can roll as many 6-sided dice as you want, and so can your opponents, simultaneously. The highest sum wins, but if there is at least one "$1$" in the roll, you score $0$ points in total.
Is there "the" best strategy with how many dice to roll in order to statistically (unlimited repeats) win the game? If there is, how can we prove it?
Our only starting point was the counterprobability for each throw. Each dice has a $5/6$ chance not to be a $1$. So $1-(5/6 + 5/6 + \ldots)$ should be at least a "$1$" in the throw. That's all we were able to manage, but we are missing the link to further calculations.
Thanks a lot for your help.
Edit: Thanks for the hint with 1−(5/6)^n
We are playing one round with only 2 players.
If it is a draw --> reroll with the selected number of dice
The other player does not know how many dice the other player selects.
The first win ends the game.
If you roll "1" the whole round scores "0"
To the question: Are you trying to win or trying to maximise the expected number of points? We are trying to find the best number of dice to win the game, but it never has occurred to me, the the number of dice of the other player is of relevance! Thanks for the input
Also thanks a lot for all of your comments. I really appreciate it.