政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/79206

政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/79206

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 113648/144635 (79%)
Visitors : 51672407 Online Users : 313

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Scope

please add "double quotation mark" for query phrases to get precise results

please goto advance search for comprehansive author search

Adv. Search

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

Goto mobile version

政大典藏 > College of Informatics > Department of Computer Science > Theses > Item 140.119/79206

Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/79206

Title:	利用棋局紀錄之個人化西洋棋開局推薦 Personalized Chess Opening Recommendation Using Game Records
Authors:	楊元翰
Contributors:	陳正佳沈錳坤楊元翰
Keywords:	西洋棋開局推薦推薦系統風格分析 Chess Opening recommendation Recommendation system Style analysis
Date:	2015
Issue Date:	2015-11-02 14:50:14 (UTC+8)
Abstract:	在西洋棋中，開局決定了棋局未來發展的基礎，棋手在開局階段局勢的好壞，會直接影響到接下來中局的發展，乃至全局的勝負。隨著西洋棋的演進，棋手們在比賽中進行各式各樣的棋步嘗試，發展出眾多經歷實戰考驗的開局，目前西洋棋的開局多達上千種變化，使得棋手在學習西洋棋的過程中，要花上大量的時間從眾多的西洋棋開局變化中，尋找適合自己的開局鑽研與使用。為幫助棋手在此階段的學習，本論文提出西洋棋開局推薦系統，從大數據協助學習的觀點，利用大量棋手們的開局經驗，對棋手做個人化的開局推薦。此系統以風格、棋力相似的棋手們所選用的開局為推薦基礎，並考量棋手習慣使用的下棋模式，推薦棋手善於發揮自身優勢、易於理解，並且投其所好的開局。為此，此西洋棋開局推薦系統包含風格分析、棋力評估、棋形截取，以及混合式推薦等部分。依據棋手過去的對局記錄，風格分析評估棋手下棋偏好冒險或保守的程度；棋力評估將傳統西洋棋棋力轉成可直觀比較棋手棋力程度差異之量表；棋形截取找出棋手習慣使用的下棋模式。最後，混合式推薦綜合考量上述三項因素，推薦出符合棋手棋風、棋力與下棋習慣模式的開局。本論文以兩個實驗來評估風格分析與開局推薦系統的效果，在風格分析的實驗中，將風格分析方法評估棋手風格的結果與專家判斷的結果做比較；在開局推薦系統的實驗中，以棋手是否將會在比賽使用系統所推薦的開局來評估推薦效果。實驗結果顯示，風格分析對於世界冠軍棋手的風格評估幾乎與專家的判斷相同；開局推薦系統針對開局所設計的混合式推薦方法，推薦效果優於常見的推薦方法。 The Opening is the fundamental phase of a chess game, and significantly affects the result of a competition. With the evolution of chess, there has been developed thousands of chess openings at present. This makes it difficult and time-consuming for chess players to find and learn the openings suitable for them. For helping players to learn chess in the opening, we provide Opening Recommendation System (OPRS), which considers chess players’ experiences and recommends chess openings that could be understandable and favorite for the players. For personalized recommendation, OPRS analyzes the playing style, translates chess rating, extracts the playing patterns, and then performs hybrid recommendation based on the features obtained. In the evaluation, the performance of the playing style analysis are demonstrated by comparing with the styles judged by chess experts for world chess championships. For OPRS, the evaluations are according to the openings the players use in the chess tournaments in the next years. The experiments show that OPRS achieves good accuracies of the playing style analysis and outperforms the competitive methods for chess opening recommendation.
Reference:	[1] G. Adomavicius, and T. Alexander, “Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions,” Knowledge and Data Engineering, IEEE Transactions on, 17(6), 734-749, 2005 [2] L. Alburt, R. Dzindzichashvili, E. Perelshteyn and A. Lawrence, Opening for black, explained: a complete repertoire, Chess Information and Research Centre, 2005. [3] R. Burke, “Hybrid recommender systems: Survey and experiments,” User modeling and user-adapted interaction, 12(4), 331-370, 2002. [4] R. Burke, “Hybrid web recommender systems,” The adaptive web, Springer Berlin Heidelberg, 377-408, 2007. [5] M. Buro, “Toward opening book learning,” ICCA Journal, 22(2), 98-102, 1999 [6] J. R. Capablanca, Chess fundamentals, Harcourt, 1921. [7] C. Donninger and U. Lorenz, “Innovative opening-book handling, ” Advances in Computer Games, Springer Berlin Heidelberg, 1-10, 2006. [8] S. L. Epstein, “Learning to play expertly: A tutorial on Hoyle,” Machines that learn to play games, 153-178, 2001. [9] R. Gemulla, et al. “Large-scale matrix factorization with distributed stochastic gradient descent”, Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, 2011. [10] M. Guid and I. Bratko, “Computer analysis of world chess champions,” ICGA Journal, 29(2), 65-73, 2006. [11] G.T. Heineman, G. Pollice, and S. Selkow, “Chapter 7:Path Finding in AI”, Algorithms in a Nutshell, Oreilly Media, 213–217, 2008. [12] Y. Hijikata, I. Kazuhiro, and N. Shogo, “Content-based music filtering system with editable user profile,” Proceedings of the 2006 ACM symposium on Applied computing, ACM, 2006. [13] D. W. Hosmer Jr and S. Lemeshow, Applied logistic regression, John Wiley & Sons, 2004. [14] A. Huang, “Similarity measures for text document clustering,” Proceedings of the sixth new zealand computer science research student conference, Christchurch, New Zealand, 2008. [15] R. M. Hyatt, “Book learning-a methodology to tune an opening book automatically,” ICCA Journal, 22(1), 3-12, 1999. [16] F. Johannes, “Machine learning in games: A survey, ” Machines that learn to Play Games, 11-59, 2001. [17] H. W. Kuhn, “The Hungarian method for the assignment problem,” Naval research logistics quarterly, 2(1‐2), 83-97, 1955. [18] M. Levene and T. Fenner, “A methodology for learning players` styles from game records,” International Journal of Artificial Intelligence and Soft Computing, 2(4), 272-286, 2011. [19] G. Lolli, Theoretical and practical observations on the game of chess, Printshop of St. Thomas Aquinas, Bologna, 1763. [20] P. Lops, M. De Gemmis and G. Semeraro, “Content-based recommender systems: State of the art and trends, ” Recommender Systems Handbook, Springer US, 73-105, 2011. [21] J. L. Myers, A. Well, and R. F. Lorch, Research design and statistical analysis, Routledge, 2010. [22] D. L. Olson, and D. Delen, Advanced data mining techniques, Springer Science & Business Media, 2008. [23] B. Pandolfini, Weapons of chess: an omnibus of chess strategies, Simon and Schuster, 1989. [24] M. J. Pazzani and D. Billsus, “Content-based recommendation systems, ” The adaptive web, Springer Berlin Heidelberg, 325-341, 2007. [25] D. Rasskin-Gutman, Chess metaphors: artificial intelligence and the human mind, MIT Press, 2009. [26] P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom and J. Riedl, “GroupLens: an open architecture for collaborative filtering of netnews,” Proceedings of the 1994 ACM Conference on Computer Supported Cooperative Work, ACM, 175-186, 1994. [27] P. Resnick and H. R. Varian, “Recommender systems,” Communications of the ACM, 40(3), 56-58, 1997. [28] J. Rowson and G. K. Burgess, Chess for Zebras: Thinking Differently about Black and White, Gambit, 2005. [29] B. Sarwar, et al, “Item-based collaborative filtering recommendation algorithms, ” Proceedings of the 10th international conference on World Wide Web, ACM, 2001. [30] J. B. Schafer, D. Frankowski, J. Herlocker and S. Sen, “Collaborative filtering recommender systems,” The adaptive web, Springer Berlin Heidelberg, 291-324, 2007. [31] J. Speelman, Endgame preparation: advanced analysis of important areas, BT Batsford, 1981. [32] R. S. Sutton and G. B. Andrew, Reinforcement learning: An introduction, Cambridge: MIT press, 1998. [33] S. Walczak, “Pattern-based tactical planning,” International Journal of Pattern Recognition and Artificial Intelligence, 6(5), 955-988, 1992. [34] S. Walczak, “Using inductive inference of past performance to build strategic cognitive adversary models,” PhD thesis, Univ. of Florida, Gainesville, Fla., 1990. [35] X. Yang, et al, “A survey of collaborative filtering based social recommender systems,” Computer Communications, 1-10, 2014. [36] N. Zhou, et al, “A hybrid probabilistic model for unified collaborative and content-based image tagging,” Pattern Analysis and Machine Intelligence, IEEE Transactions on, 33(7), 1281-1294, 2011. [37] Chess Programing Wiki, Material, https://chessprogramming.wikispaces.com/Material [38] Chess Programing Wiki, Opening Book, http://chessprogramming.wikispaces.com/Opening+Book [39] ChessBase Shop, Big Database 2010, http://shop.chessbase.com/en/products/big_database_2010_dvd [40] Wikipedia, Chess , http://en.wikipedia.org/wiki/Chess [41] Wikipedia, Chess endgame, http://en.wikipedia.org/wiki/Chess_endgame [42] Wikipedia, Chess_middlegame , http://en.wikipedia.org/wiki/Chess_middlegame [43] Wikipedia, Chess opening, http://en.wikipedia.org/wiki/Chess_opening [44] Wikipedia, Chess piece relative value, http://en.wikipedia.org/wiki/Chess_piece_relative_value [45] Wikipedia, Encyclopaedia of Chess Openings, https://en.wikipedia.org/wiki/Encyclopaedia_of_Chess_Openings [46] Wikipedia, Elo rating system, http://en.wikipedia.org/wiki/Elo_rating_system [47] Wikipedia, Portable Game Notation, https://en.wikipedia.org/wiki/Portable_Game_Notation
Description:	碩士國立政治大學資訊科學學系 101753012
Source URI:	http://thesis.lib.nccu.edu.tw/record/#G0101753012
Data Type:	thesis
Appears in Collections:	[Department of Computer Science ] Theses

Files in This Item:

File	Size	Format
301201.pdf	2124Kb	Adobe PDF2	463	View/Open

All items in 政大典藏 are protected by copyright, with all rights reserved.

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

DSpace Software Copyright © 2002-2004 MIT & Hewlett-Packard / Enhanced by NTU Library IR team Copyright © - Feedback