Factorization ranking model for move prediction in the game of go

7Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we investigate the move prediction problem in the game of Go by proposing a new ranking model named Factorization Bradley Terry (FBT) model. This new model considers the move prediction problem as group competitions while also taking the interaction between features into account. A FBT model is able to provide a probability distribution that expresses a preference over moves. Therefore it can be easily compiled into an evaluation function and applied in a modern Go program. We propose a Stochastic Gradient Decent (SGD) algorithm to train a FBT model using expert game records, and provide two methods for fast computation of the gradient in order to speed up the training process. Experimental results show that our FBT model outperforms the state-of-The-Art move prediction system of Latent Factor Ranking (LFR).

Cite

CITATION STYLE

APA

Xiao, C., & Müller, M. (2016). Factorization ranking model for move prediction in the game of go. In 30th AAAI Conference on Artificial Intelligence, AAAI 2016 (pp. 1359–1365). AAAI press. https://doi.org/10.1609/aaai.v30i1.10180

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free