Automatic Bidding for the Game of Skat
作者： Thomas Keller , Sebastian Kupferschmid
DOI: 10.1007/978-3-540-85845-4_12
关键词: Neighbor algorithm 、 Artificial intelligence 、 Engineering 、 Machine learning 、 Knowledge base 、 Drawback 、 Bidding
摘要: In recent years, researchers started to study the game of Skat. The strength existing Skat playing programs is definitely card play phase. bidding phase, however, has been treated quite poorly so far. This a severe drawback since abilities influence overall performance drastically. this paper we present powerful engine which based on k-nearest neighbor algorithm.
springer.com
skatgame.net 参考文章(4)
M.H.M. Winands, H.J. van den Herik, X. Xu, Z. Ma, Computers and Games ,(2008)
Matthew L. Ginsberg, GIB: Steps Toward an Expert-Level Bridge-Playing Program international joint conference on artificial intelligence. pp. 584- 593 ,(1999)
Sebastian Kupferschmid, Malte Helmert, A skat player based on Monte-Carlo simulation annual conference on computers. pp. 135- 147 ,(2006) , 10.1007/978-3-540-75538-8_12
Ian Frank, David Basin, Search in games with incomplete information: a case study using Bridge card play Artificial Intelligence. ,vol. 100, pp. 87- 123 ,(1998) , 10.1016/S0004-3702(97)00082-9