references.bib

 @misc{nica_2021,
    title={Pig\textunderscore Simulator.ipynb},
    url={https://colab.research.google.com/drive/1Mdk26YQYhUsfDSFNYzAL-qA9g_QmFooa?usp=sharing#scrollTo=4VQQk2fTe_sF},
    journal={Google Colab},
    author={Nica, Mihai},
    year={2021},month={4}
 }
 
 @misc{ye_2022,
    title={A crash course in Markov decision processes, the bellman equation, and dynamic programming},
    url={https://medium.com/mlearning-ai/a-crash-course-in-markov-decision-processes-the-bellman-equation-and-dynamic-programming-e80182207e85},
    journal={Medium},
    publisher={MLearning.ai},
    author={Ye, Andre},
    year={2022},
    month={Mar}
}

@misc{crocce_2009,
  doi = {10.48550/ARXIV.0912.5518},
  url = {https://arxiv.org/abs/0912.5518},
  author = {Crocce, Fabian and Mordecki, Ernesto},
  keywords = {Probability (math.PR), Computer Science and Game Theory (cs.GT), Optimization and Control (math.OC), FOS: Mathematics, FOS: Mathematics, FOS: Computer and information sciences, FOS: Computer and information sciences, 60J10; 91A15},
  title = {Optimal minimax strategy in a dice game},
  publisher = {arXiv},
  year = {2009},
  copyright = {arXiv.org perpetual, non-exclusive license}
}

@article{haigh_2000,
 ISSN = {00219002},
 URL = {http://www.jstor.org/stable/3215500},
 abstract = {Computer simulations had suggested that the strategy that maximises the score on each turn in the dice game described by Roters (1998) may not be the optimal way to reach a given target in the shortest time. We give an analytical treatment, backed by numerical calculations, that finds the optimal strategy to reach such a target.},
 author = {John Haigh and Markus Roters},
 journal = {Journal of Applied Probability},
 number = {4},
 pages = {1110--1116},
 publisher = {Applied Probability Trust},
 title = {Optimal Strategy in a Dice Game},
 volume = {37},
 year = {2000}
}

@article{Roters_1998,
 ISSN = {00219002},
 URL = {http://www.jstor.org/stable/3215561},
 abstract = {In this paper we consider an explicit solution of an optimal stopping problem arising in connection with a dice game. An optimal stopping rule and the maximum expected reward in this problem can easily be computed by means of the distributions involved and the specific rules of the game.},
 author = {Markus Roters},
 journal = {Journal of Applied Probability},
 number = {1},
 pages = {229--235},
 publisher = {Applied Probability Trust},
 title = {Optimal Stopping in a Dice Game},
 volume = {35},
 year = {1998}
}