Search in games with incomplete information: a case study using Bridge card play

DOI10.1016/S0004-3702(97)00082-9zbMath0906.68049OpenAlexW2029757490MaRDI QIDQ1128766

Ian Frank, David A. Basin

Publication date: 13 August 1998

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(97)00082-9

zbMATH Keywords

game theoryincomplete informationgame tree searchcomputer bridge

Mathematics Subject Classification ID

Searching and sorting (68P10) Game theory (91A99)

Related Items (4)

Information capture and reuse strategies in Monte Carlo Tree Search, with applications to games of hidden information ⋮ Limited lookahead in imperfect-information games ⋮ Unnamed Item ⋮ A theoretical and empirical investigation of search in imperfect information games

Cites Work

• On the nature of pathology in game searching
• Non-cooperative games
• Program for Double-Dummy Bridge Problems—A New Strategy for Mechanical Game Playing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Search in games with incomplete information: a case study using Bridge card play