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

摘要: Abstract We examine search algorithms in games with incomplete information, formalising a best defence model of such based on the assumptions typically made when information problems are analysed expert texts. show that equilibrium point strategies for optimal play exist this model, and define an algorithm capable computing strategies. Using as reference we then analyse architectures have been proposed game Bridge. These select by analysing some statistically significant collection complete sub-games. Our allows us to clearly state limitations producing analysis, precisely formalise distinguish lead sub-optimality. illustrate these simple trees actual situations from Bridge itself.