Abstract
In this work we propose a framework for predicting chess match outcome while the game is in progress. We make this prediction by examining the moves made by the players. For this purpose, we propose a novel ensemble based learning technique where a profile-based segmentation is done on the training dataset, and one classifier is trained from each such segment. Then the ensemble of classifiers is used to predict the outcome of new chess matches. When a new game is being played this ensemble model is used to dynamically predict the probabilities of white winning, black winning, and drawing after every move. We have evaluated our system with different base learning techniques as well as with different types of features and applied our technique on a large corpus of real chess matches, achieving higher prediction accuracies than traditional classification techniques. We have achieved prediction accuracies close to 66% and most of the correct predictions were made with nine or more moves before the game ended. We believe that this work will motivate the development of online prediction systems for other games, such as other board games and even some field games.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bifet, A., Holmes, G., Pfahringer, B., Kirkby, R., Gavald, R.: New ensemble methods for evolving data streams. In: Proc. SIGKDD, pp. 139–148 (2009)
ChessOK.com: Chessok. www.chessok.com
Fan, Z., Kuang, Y., Lin, X.: Chess game result prediction system. Tech. rep. Stanford University (2013)
Ferreira, D.R.: Predicting the outcome of chess games based on historical data. Tech. rep., IST - Technical University of Lisbon (November 2010)
Ferreira, D.R.: Determining the strength of chess players based on actual play. ICGA Journal 35(1), 3–19 (2012)
Hsu, F.H.: Behind Deep Blue: Building the Computer That Defeated the World Chess Champion. Princeton University Press, Princeton (2002)
Ifrim, G., Wiuf, C.: Bounded coordinate-descent for biological sequence classification in high dimensional predictor space. In: KDD 2011, pp. 708–716 (2011)
Katakis, I., Tsoumakas, G., Vlahavas, I.: Tracking recurring contexts using ensemble classifiers: an application to email filtering. Knowl. and Info. S. 22, 371–391 (2010)
U-of Waikato ML group: Weka. http://www.cs.waikato.ac.nz/ml/weka/
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Masud, M., Al-Shehhi, A., Al-Shamsi, E., Al-Hassani, S., Al-Hamoudi, A., Khan, L. (2015). Online Prediction of Chess Match Result. In: Cao, T., Lim, EP., Zhou, ZH., Ho, TB., Cheung, D., Motoda, H. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2015. Lecture Notes in Computer Science(), vol 9077. Springer, Cham. https://doi.org/10.1007/978-3-319-18038-0_41
Download citation
DOI: https://doi.org/10.1007/978-3-319-18038-0_41
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18037-3
Online ISBN: 978-3-319-18038-0
eBook Packages: Computer ScienceComputer Science (R0)