A theoretical and empirical investigation of search in imperfect information games
type: Item
instance of: scholarly article
title: A theoretical and empirical investigation of search in imperfect information games
zbMATH Open document ID: 0954.68056
DOI: 10.1016/S0304-3975(00)00083-9
author: R. Smith
published in: Theoretical Computer Science
publication date: 2000-12-12T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1542316
zbMATH Keywords: game tree search
zbMATH Keywords: imperfect information
zbMATH Keywords: game theory
zbMATH Keywords: Bridge
MaRDI profile type: Publication
cites work: Q3997090
cites work: Search in games with incomplete information: a case study using Bridge card play
cites work: Q4198056
cites work: Efficient computation of equilibria for extensive two-person games
cites work: Q3252269
cites work: The last player theorem
cites work: PYTHON: An expert squeezer
cites work: Q5802493
full work available at URL: s0304-3975(00)00083-9
OpenAlex ID: W1969269538
Recommended article: Search Theory
Recommended article: Q3172532
Recommended article: Q3216473
Recommended article: On the compensation of imperfect information in dynamic games
Recommended article: Q4948581
Recommended article: Q4811987
Recommended article: Q4431211
Recommended article: A new theory of equilibrium selection for games with incomplete information
Recommended article: Limited lookahead in imperfect-information games
description: scientific article; zbMATH DE number 1542316