電腦對局一直是人工智慧這個領域佔有很重要的一部分，因為電腦並沒有辦法像人類一樣跳躍性的思考，所以如何讓電腦的實力變得跟人類一樣是個值得投入的領域。
我們的目的是開發出一款執行速度快、又有一定實力可以跟人類玩家抗衡的蜜月橋牌程式，而現在發展電腦蜜月橋牌的論文並不多，所以在這方面還有蠻大發展的空間。
本研究開發無王合約的演算法以及改良前人第一階段喊牌的策略及第二階段換牌的審局函數。實驗測試發現，新的喊牌策略、換牌策略都比原來的還要好。而無王演算法也成功的建立。加入了針對蜜月橋牌而改良Alpha-Beta pruning演算法也讓速度提昇。

Computer game is always an important part in artificial intelligence. Because computer cannot think like human beings, how to let the computer’s playing strength close to human is a worthy field to study.
Our purpose is to develop a Honeymoon bridge program that is fast and smart, and can compete with human. There is not much research about Honeymoon bridge program, so there remains a great research space in this field.
This research is to build the algorithms for No-Trump contract, and to improve the bidding strategy in the first stage and the exchanging cards' strategy in the second stage. Through the experiments, we can find out that the new strategies are better than the old ones. And the algorithms for No-Trump contract were built successfully. We modify the Alpha-Beta pruning algorithm to suit for Honeymoon bridge and promote the speed of our algorithm.

[1]葉俊廷，不完全資訊賽局 － 蜜月橋牌之研究，國立台灣師範大學資工所碩士論文，2009。
[2]張瓈文，「德州撲克」 不完全資訊賽局之研究，國立台灣師範大學資工所碩士論文，2005。
[3] Wikipedia, http://zh.wikipedia.org/wiki/Wiki.
[4]勞永祥，電腦暗棋之人工智慧改良，國立臺灣師範大學資工所碩士論文，2011。[5] J. V. Neumann, ”Zur Theorie der gesellschaftsspiele”, Math. Ann, 1928.
[6] J. Nash, ”Non-cooperative Games”, Math. Ann, 1951.
[7] Honeymoon Bridge, http://www.pagat.com/boston/honeymoon.html.
[8] S. J. Russell, P. Norvig, Artificial Intelligence: A Modern Approach, Pearson International Edition, 2003.
[9] T. H. Cormen, C. E. Leiserson, R. L. Riverst, C. Stein, Introduction to Algrithms, MIT Press, 2003.
[10] Contract Bridge, http://www.rpbridge.net/1a00.htm.
[11] J. Swanson, Game Theory and Poker., 2005
[12] Chessprogramming, http://chessprogramming.wikispaces.com/.