Ten times eighteen. Böcker, S. *J Inform Process Jpn*, 23(3):258–264, 2015. doi abstract bibtex We consider the following simple game: We are given a table with ten slots indexed one to ten. In each of the ten rounds of the game, three dice are rolled and the numbers are added. We then put this number into any free slot. For each slot, we multiply the slot index with the number in this slot, and add up the products. The goal of the game is to maximize this score. In more detail, we play the game many times, and try to maximize the sum of scores or, equivalently, the expected score. We present a strategy to optimally play this game with respect to the expected score. We then modify our strategy so that we need only polynomial time and space. Finally, we show that knowing all ten rolls in advance, results in a relatively small increase in score. Although the game has a random component and requires a non-trivial strategy to be solved optimally, this strategy needs only polynomial time and space.

@Article{boecker15ten,
author = {Sebastian B\"ocker},
title = {Ten times eighteen},
journal = {J Inform Process Jpn},
year = {2015},
volume = {23},
number = {3},
pages = {258--264},
abstract = {We consider the following simple game: We are given a table with ten slots indexed one to ten. In each of the ten rounds of the game, three dice are rolled and the numbers are added. We then put this number into any free slot. For each slot, we multiply the slot index with the number in this slot, and add up the products. The goal of the game is to maximize this score. In more detail, we play the game many times, and try to maximize the sum of scores or, equivalently, the expected score. We present a strategy to optimally play this game with respect to the expected score. We then modify our strategy so that we need only polynomial time and space. Finally, we show that knowing all ten rolls in advance, results in a relatively small increase in score. Although the game has a random component and requires a non-trivial strategy to be solved optimally, this strategy needs only polynomial time and space.},
doi = {10.2197/ipsjjip.23.258},
keywords = {jena;},
owner = {Sebastian},
timestamp = {2015.01.08},
}

Downloads: 0

{"_id":"8QN4rRF35RA3NisYa","bibbaseid":"bcker-tentimeseighteen-2015","authorIDs":[],"author_short":["Böcker, S."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Sebastian"],"propositions":[],"lastnames":["Böcker"],"suffixes":[]}],"title":"Ten times eighteen","journal":"J Inform Process Jpn","year":"2015","volume":"23","number":"3","pages":"258–264","abstract":"We consider the following simple game: We are given a table with ten slots indexed one to ten. In each of the ten rounds of the game, three dice are rolled and the numbers are added. We then put this number into any free slot. For each slot, we multiply the slot index with the number in this slot, and add up the products. The goal of the game is to maximize this score. In more detail, we play the game many times, and try to maximize the sum of scores or, equivalently, the expected score. We present a strategy to optimally play this game with respect to the expected score. We then modify our strategy so that we need only polynomial time and space. Finally, we show that knowing all ten rolls in advance, results in a relatively small increase in score. Although the game has a random component and requires a non-trivial strategy to be solved optimally, this strategy needs only polynomial time and space.","doi":"10.2197/ipsjjip.23.258","keywords":"jena;","owner":"Sebastian","timestamp":"2015.01.08","bibtex":"@Article{boecker15ten,\n author = {Sebastian B\\\"ocker},\n title = {Ten times eighteen},\n journal = {J Inform Process Jpn},\n year = {2015},\n volume = {23},\n number = {3},\n pages = {258--264},\n abstract = {We consider the following simple game: We are given a table with ten slots indexed one to ten. In each of the ten rounds of the game, three dice are rolled and the numbers are added. We then put this number into any free slot. For each slot, we multiply the slot index with the number in this slot, and add up the products. The goal of the game is to maximize this score. In more detail, we play the game many times, and try to maximize the sum of scores or, equivalently, the expected score. We present a strategy to optimally play this game with respect to the expected score. We then modify our strategy so that we need only polynomial time and space. Finally, we show that knowing all ten rolls in advance, results in a relatively small increase in score. Although the game has a random component and requires a non-trivial strategy to be solved optimally, this strategy needs only polynomial time and space.},\n doi = {10.2197/ipsjjip.23.258},\n keywords = {jena;},\n owner = {Sebastian},\n timestamp = {2015.01.08},\n}\n\n","author_short":["Böcker, S."],"key":"boecker15ten","id":"boecker15ten","bibbaseid":"bcker-tentimeseighteen-2015","role":"author","urls":{},"keyword":["jena;"],"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://git.bio.informatik.uni-jena.de/fleisch/literature/raw/master/group-literature.bib","creationDate":"2019-11-19T16:29:35.060Z","downloads":0,"keywords":["jena;"],"search_terms":["ten","times","eighteen","böcker"],"title":"Ten times eighteen","year":2015,"dataSources":["C5FtkvWWggFfMJTFX"]}