Preference Learning for Move Prediction and Evaluation Function Approximation in Othello

被引:18
作者
Runarsson, Thomas Philip [1 ]
Lucas, Simon M. [2 ]
机构
[1] Univ Iceland, Sch Engn & Nat Sci, IS-101 Reykjavik, Iceland
[2] Univ Essex, Sch Comp Sci & Elect Engn, Colchester CO4 3SQ, Essex, England
基金
英国工程与自然科学研究理事会;
关键词
Computational and artificial intelligence; n-tuple; preference learning; temporal difference learning; Othello; GAME; ALGORITHMS;
D O I
10.1109/TCIAIG.2014.2307272
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper investigates the use of preference learning as an approach to move prediction and evaluation function approximation, using the game of Othello as a test domain. Using the same sets of features, we compare our approach with least squares temporal difference learning, direct classification, and with the Bradley-Terry model, fitted using minorization-maximization (MM). The results show that the exact way in which preference learning is applied is critical to achieving high performance. Best results were obtained using a combination of board inversion and pair-wise preference learning. This combination significantly outperformed the others under test, both in terms of move prediction accuracy, and in the level of play achieved when using the learned evaluation function as a move selector during game play.
引用
收藏
页码:300 / 313
页数:14
相关论文
共 43 条