Presenter

Conference ICAI’05 Problems of incomplete information include a component of unknown information. We investigate such problems through a study of the bidding phase in the game of Bridge. In particular, we would like to apply genetic algorithms to the Bridge bidding problem. Genetic algorithms, however, require a fitness function appropriate for the problem. Therefore, in this paper, we first attack the optimization problem of finding the maximum number of tricks that can be taken in a bridge hand with optimal play and with complete information. Solutions from this optimization problem will subsequently be used as fitness functions in applying genetic algorithms to the bidding problem. Key words: artificial intelligence, problems of incomplete information, search methods, game of bridg