Back-Propagation Neural Network Architecture for Solving the Double Dummy Bridge Problem in Contract Bridge

Contract Bridge is an intelligent game, which increases the expose with multiple skills and knowledge because no player knows exactly what moves other players are capable of making. The 'Bridge', being a game of imperfect information, is to be equally well defined, since the outcome at any intermediate stage is purely based on the decision made on the immediate preceding stage. The credits accumulated by one pair of bridge players towards the target in a fixed number of 'tricks' is called Double Dummy Bridge Problem. The Back-propagation neural network architecture is used to take the best tricks in Double Dummy Bridge Problem. In summary, the study described in this paper provides a detailed comparison between two different activation functions which were used to train and test the data, hence their behavior in different situations.

[1]  R Amalraj,et al.  Supervised Learning in Imperfect Information Game , 2013 .

[2]  Jacek Mandziuk,et al.  Artificial Neural Networks for Solving Double Dummy Bridge Problems , 2004, ICAISC.

[3]  Matthew L. Ginsberg,et al.  GIB: Imperfect Information in a Computationally Challenging Game , 2011, J. Artif. Intell. Res..

[4]  Dana S. Nau,et al.  Computer Bridge - A Big Win for AI Planning , 1998, AI Mag..

[5]  Jacek Mandziuk,et al.  Knowledge-Free and Learning-Based Methods in Intelligent Game Playing , 2010, Studies in Computational Intelligence.

[6]  Dana S. Nau,et al.  Success in Spades: Using AI Planning Techniques to Win the World Championship of Computer Bridge , 1998, AAAI/IAAI.

[7]  Jacek Mandziuk,et al.  Example-based Estimation of Hand's Strength in the Game of Bridge with or without Using Explicit Human Knowledge , 2007, 2007 IEEE Symposium on Computational Intelligence and Data Mining.

[8]  Ian Frank,et al.  A theoretical and empirical investigation of search in imperfect information games , 2001, Theor. Comput. Sci..

[9]  Jacek Mandziuk,et al.  Computational Intelligence in Mind Games , 2007, Challenges for Computational Intelligence.

[10]  B. Yegnanarayana,et al.  Artificial Neural Networks , 2004 .

[11]  Dana S. Nau,et al.  An Analysis of Forward Pruning , 1994, AAAI.

[12]  Jacek Mandziuk,et al.  Some thoughts on using Computational Intelligence methods in classical mind board games , 2008, 2008 IEEE International Joint Conference on Neural Networks (IEEE World Congress on Computational Intelligence).

[13]  Takahisa Ando,et al.  Reasoning by Agents in Computer Bridge Bidding , 2000, Computers and Games.

[14]  Jacek Mandziuk,et al.  Learning Without Human Expertise: A Case Study of the Double Dummy Bridge Problem , 2009, IEEE Transactions on Neural Networks.

[15]  Jacek Mandziuk,et al.  Neural networks compete with expert human players in solving the Double Dummy Bridge Problem , 2009, 2009 IEEE Symposium on Computational Intelligence and Games.

[16]  Shaul Markovitch,et al.  Learning to bid in bridge , 2006, Machine Learning.

[17]  Noriyuki Kobayashi,et al.  Cooperation and competition of agents in the auction of computer bridge , 2003 .

[18]  Ian Frank.  Strategies Explained , 1999 .

[19]  May Dehayni,et al.  An ATMS-Based Tool for Locating Honor Cards in Rubber Bridge , 2011 .

[20]  C.A.L. Bailer-Jones,et al.  An introduction to artificial neural networks , 2001 .

[21]  Ian Frank,et al.  Optimal Play against Best Defence: Complexity and Heuristics , 1998, Computers and Games.

[22]  B. Yegnanarayana,et al.  Neural networks for contract bridge bidding , 1996 .

[23]  Jacek Mańdziuk.  An Overview of Computational Intelligence Methods , 2010 .

[24]  Deepak Khemani.  Planning with Thematic Actions , 1994, AIPS.