A theoretical and empirical investigation of search in imperfect information games

DOI10.1016/S0304-3975(00)00083-9zbMath0954.68056OpenAlexW1969269538MaRDI QIDQ1589518

R. Smith

Publication date: 12 December 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00083-9

zbMATH Keywords

game theorygame tree searchimperfect informationBridge

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Cites Work

• Search in games with incomplete information: a case study using Bridge card play
• The last player theorem
• Efficient computation of equilibria for extensive two-person games
• PYTHON: An expert squeezer
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item