The best banking strategy when playing The Weakest Link

Journal of the Operational Research Society

Volumn 54, Issue 7, 2003, Pages 747-750

  Thomas, L C ^a  

^a UNIVERSITY OF SOUTHAMPTON   (United Kingdom)

Author keywords

Dynamic programming; Recreation

Indexed keywords

COMPUTATIONAL METHODS; GAME THEORY; OPTIMIZATION; PROBABILITY;

OPTIMAL BANKING STRATEGY;

DYNAMIC PROGRAMMING;

EID: 0038234872     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601567     Document Type: Article

References (4)

1. Rump CM (2001). Who wants to see a $million error? Inform Trans Educ 1(3).
2. The Freecell Project, web address: http:member.aol.com/wgre-view/fcfaq.html.
3. Smith DK (1999). Dynamic prgoramming and board games. Working Paper, presented at IFORS Conference, School of Mathematics, University of Exeter, Beijing, 1999.
4. Puterman MN (1994). Markov Decision Process. Wiley: New York.