A345383 a(n) is the code of the optimum strategy to win the game 'Super Six' for two players if there are n sticks left in the game.
0, 0, 1, 7, 63, 1023, 32760, 1048544, 33554304, 1073741312, 34359736320, 1099511619584, 35184370221056, 1125899873681408, 36028796752101376
Offset: 1
Examples
a(4) = 7. With 4 sticks left in the game, there are three situations in which a player has a choice. In all situations, the best strategy is to keep rolling the die. Hence, the best strategy is "111", which, when converted to a decimal number, gives 7.
Links
- Rüdiger Jehn, How to win Super Six - Theorem 4, Youtube video, Jun 7 2019.
- Rüdiger Jehn, Optimum Strategies for the Game Super Six, arXiv:2109.10700 [math.GM], 2021.
- Michael Höhle, How to Win a Game (or More) of Super Six, blog, Mar 13 2023.
- Eshed Schacham, Solving Super Six, blog, Aug 2 2024.
- Wikipedia, Super Six (Spiel) (in German)
Extensions
a(15) from Ruediger Jehn, Oct 05 2021
Comments