Learning Without Human Expertise: A Case Study of the Double Dummy Bridge Problem

• Published in: IEEE transaction on neural networks and learning systems 2009-02, Vol.20 (2), p.278-299
• Main Authors: Mossakowski, K., Mandziuk, J.
• Format: Article
• Language: English
• Subjects: Applied sciences; Architecture; Artificial Intelligence; Bridges; Cards; Computer science; control theory; systems; Connectionism. Neural networks; Contracts; Double dummy bridge problem (DDBP); Exact sciences and technology; example-based learning; Feedforward neural networks; game of bridge; Human; Humans; Knowledge representation; knowledge-free approach; Networks; Neural networks; Neural Networks (Computer); Neurons; Pattern analysis; Performance evaluation; Play and Playthings; Players; Representations; Reproducibility of Results; Studies; Testing
• ISSN: 1045-9227; 2162-237X; 1941-0093; 2162-2388
• DOI: 10.1109/TNN.2008.2005526

Artificial neural networks, trained only on sample deals, without presentation of any human knowledge or even rules of the game, are used to estimate the number of tricks to be taken by one pair of bridge players in the so-called double dummy bridge problem (DDBP). Four representations of a deal in the input layer were tested leading to significant differences in achieved results. In order to test networks' abilities to extract knowledge from sample deals, experiments with additional inputs representing estimators of hand's strength used by humans were also performed. The superior network trained solely on sample deals outperformed all other architectures, including those using explicit human knowledge of the game of bridge. Considering the suit contracts, this network, in a sample of 100 000 testing deals, output a perfect answer in 53.11% of the cases and only in 3.52% of them was mistaken by more than one trick. The respective figures for notrump contracts were equal to 37.80% and 16.36%. The above results were compared with the ones obtained by 24 professional human bridge players-members of The Polish Bridge Union-on test sets of sizes between 27 and 864 deals per player (depending on player's time availability). In case of suit contracts, the perfect answer was obtained in 53.06% of the testing deals for ten upper-classified players and in 48.66% of them, for the remaining 14 participants of the experiment. For the notrump contracts, the respective figures were equal to 73.68% and 60.78%. Except for checking the ability of neural networks in solving the DDBP, the other goal of this research was to analyze connection weights in trained networks in a quest for weights' patterns that are explainable by experienced human bridge players. Quite surprisingly, several such patterns were discovered (e.g., preference for groups of honors, drawing special attention to Aces , favoring cards from a trump suit, gradual importance of cards in one suit-from two to the Ace , etc.). Both the numerical figures and weight patterns are stable and repeatable in a sample of neural architectures (differing only by randomly chosen initial weights). In summary, the piece of research described in this paper provides a detailed comparison between various data representations of the DDBP solved by neural networks. On a more general note, this approach can be extended to a certain class of binary classification problems.