This game is based on Taskmaster Series 3 Episode 5.
You have a stick, and some doughnuts (one doughnut for every player in the game). Each round, you decide how many doughnuts to place on your stick. All other players do the same. Once everyone has decided, the choices are revealed, and the winner is the player who has selected the smallest unique number of doughnuts to place on their stick. If no one's selection is unique, then there is no winner, and we repeat the round until a winner is found.
Here you can play the game against multiple AI players. The different AI players are named according to the different strategies that they are following. If you can start to understand how the different players are playing, then it is possible to exploit them and gain an advantage.
You are free to change the mix of AI players in the game using the dropdown boxes. Some combinations are easier to beat than others. If you only put Nash players in the game, then it will be impossible for you to gain any advantage (although chances are that they will also have no advantage over you, so that there is an equal chance of any player coming out on top). But if there are any non-Nash players playing, and you can figure out their strategy, then theoretically the game is beatable, in the sense that there will be a strategy you can follow which gives you a better chance of winning than 1/number of players.
To read more about how the Nash equilibrium strategy works, see the readme here.
Good luck!
| Player | Last move | Total points |
|---|