IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v176y2007i3p1299-1318.html
   My bibliography  Save this article

Dynamic programming and board games: A survey

Author

Listed:
  • Smith, David K.

Abstract

No abstract is available for this item.

Suggested Citation

  • Smith, David K., 2007. "Dynamic programming and board games: A survey," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1299-1318, February.
    • Handle: RePEc:eee:ejores:v:176:y:2007:i:3:p:1299-1318
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00828-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. John D. C. Little & Katta G. Murty & Dura W. Sweeney & Caroline Karel, 1963. "An Algorithm for the Traveling Salesman Problem," Operations Research, INFORMS, vol. 11(6), pages 972-989, December.
    2. Michael A. Trick, 2001. "Building a Better Game through Dynamic Programming: A Flip Analysis," INFORMS Transactions on Education, INFORMS, vol. 2(1), pages 50-58, September.
    3. L C Thomas, 2003. "The best banking strategy when playing The Weakest Link," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(7), pages 747-750, July.
    4. Christopher M. Rump, 2001. "Who Wants to See a $Million Error?," INFORMS Transactions on Education, INFORMS, vol. 1(3), pages 102-111, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Johnston, Iain G., 2022. "Optimal strategies in the fighting fantasy gaming system: Influencing stochastic dynamics by gambling with limited resource," European Journal of Operational Research, Elsevier, vol. 302(3), pages 1272-1281.
    2. Perea, Federico & Puerto, Justo, 2007. "Dynamic programming analysis of the TV game "Who wants to be a millionaire?"," European Journal of Operational Research, Elsevier, vol. 183(2), pages 805-811, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Johnston, Iain G., 2022. "Optimal strategies in the fighting fantasy gaming system: Influencing stochastic dynamics by gambling with limited resource," European Journal of Operational Research, Elsevier, vol. 302(3), pages 1272-1281.
    2. Perea, Federico & Puerto, Justo, 2007. "Dynamic programming analysis of the TV game "Who wants to be a millionaire?"," European Journal of Operational Research, Elsevier, vol. 183(2), pages 805-811, December.
    3. Avraham, Edison & Raviv, Tal, 2020. "The data-driven time-dependent traveling salesperson problem," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 25-40.
    4. José Berenguel & L. Casado & I. García & Eligius Hendrix, 2013. "On estimating workload in interval branch-and-bound global optimization algorithms," Journal of Global Optimization, Springer, vol. 56(3), pages 821-844, July.
    5. Gerardo Berbeglia & Jean-François Cordeau & Irina Gribkovskaia & Gilbert Laporte, 2007. "Static pickup and delivery problems: a classification scheme and survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(1), pages 1-31, July.
    6. Carter, Arthur E. & Ragsdale, Cliff T., 2006. "A new approach to solving the multiple traveling salesperson problem using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 175(1), pages 246-257, November.
    7. N. Kazazakis & C. S. Adjiman, 2018. "Arbitrarily tight $$\alpha $$ α BB underestimators of general non-linear functions over sub-optimal domains," Journal of Global Optimization, Springer, vol. 71(4), pages 815-844, August.
    8. Öztürkoğlu, Ömer & Hoser, Deniz, 2019. "A discrete cross aisle design model for order-picking warehouses," European Journal of Operational Research, Elsevier, vol. 275(2), pages 411-430.
    9. Joaquín Antonio Pacheco Bonrostro, 1995. "Problemas de rutas con carga y descarga en sistemas lifo: soluciones exactas," Estudios de Economia Aplicada, Estudios de Economia Aplicada, vol. 3, pages 69-86, Junio.
    10. Xiang Liu & Zhuangzhuang Han & Matthew S. Johnson, 2018. "The UMP Exact Test and the Confidence Interval for Person Parameters in IRT Models," Psychometrika, Springer;The Psychometric Society, vol. 83(1), pages 182-202, March.
    11. S. Dharmaraja & Srijan Narang & Vidyottama Jain, 2020. "A mathematical model for supply chain management of blood banks in India," OPSEARCH, Springer;Operational Research Society of India, vol. 57(2), pages 541-552, June.
    12. Tomáš Režnar & Jan Martinovič & Kateřina Slaninová & Ekaterina Grakova & Vít Vondrák, 2017. "Probabilistic time-dependent vehicle routing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(3), pages 545-560, September.
    13. Bogna MRÓWCZYŃSKA, 2015. "Multicriteria vehicle routing problem solved by artificial immune system," Transport Problems, Silesian University of Technology, Faculty of Transport, vol. 10(3), pages 141-152, September.
    14. Singh, Kashi N. & van Oudheusden, Dirk L., 1997. "A branch and bound algorithm for the traveling purchaser problem," European Journal of Operational Research, Elsevier, vol. 97(3), pages 571-579, March.
    15. M. Gaudioso & L. Moccia & M. F. Monaco, 2010. "Repulsive Assignment Problem," Journal of Optimization Theory and Applications, Springer, vol. 144(2), pages 255-273, February.
    16. Martin Vesely, 2023. "Finding the Optimal Currency Composition of Foreign Exchange Reserves with a Quantum Computer," Working Papers 2023/1, Czech National Bank.
    17. Steven M. Shugan, 2002. "Editorial: Marketing Science, Models, Monopoly Models, and Why We Need Them," Marketing Science, INFORMS, vol. 21(3), pages 223-228.
    18. John D. C. Little, 2001. "The History of the Marketing College Is a Work in Progress," Marketing Science, INFORMS, vol. 20(4), pages 364-372.
    19. Nait Tahar, Djamel & Yalaoui, Farouk & Chu, Chengbin & Amodeo, Lionel, 2006. "A linear programming approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 63-73, February.
    20. L C Thomas, 2003. "The best banking strategy when playing The Weakest Link," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(7), pages 747-750, July.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:176:y:2007:i:3:p:1299-1318. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.