Dynamic programming and board games: a survey
type: Item
instance of: scholarly article
title: Dynamic programming and board games: a survey
zbMATH Open document ID: 1110.90078
author: David K. Smith
published in: European Journal of Operational Research
publication date: 2006-11-15T00:00:00Z
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 91A40
zbMATH DE Number: 5073120
zbMATH Keywords: dynamic programming
zbMATH Keywords: leisure
MaRDI profile type: Publication
full work available at URL: j.ejor.2005.10.026
OpenAlex ID: W2049960624
cites work: Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
cites work: Proof-number search
cites work: Mu Torere: An Analysis of a Maori Game
cites work: ON THE APPLICATION OF DYNAMIC PROGRAMING TO THE DETERMINATION OF OPTIMAL PLAY IN CHESS AND CHECKERS
cites work: Q3944542
cites work: Q3123653
cites work: Q3123647
cites work: Optimal Strategies for the Game of Darts
cites work: An Algorithm for the Traveling Salesman Problem
cites work: Mini-Risk: Strategies for a Simplified Board Game
cites work: Optimal control of diffusion processes with reflection
cites work: Q5585340
cites work: Q3999510
cites work: Markov Chains and the RISK Board Game
cites work: The best banking strategy when playing The Weakest Link
cites work: The memory game
DOI: 10.1016/J.EJOR.2005.10.026
description: scientific article; zbMATH DE number 5073120