@inbook{f132357f19cd4c9ba68cf023aad626b0,
title = "Move Ordering using Neural Networks",
abstract = "The efficiency of alpha-beta search algorithms heavily depends on the order in which the moves are examined. This paper focuses on using neural networks to estimate the likelihood of a move being the best in a certain position. The moves considered more likely to be the best are examined first. We selected Lines of Action as a testing ground. We investigated several schemes to encode the moves in a neural net- work. In the experiments, the best performance was obtained by using one output unit for each possible move of the game. The results indicate that our move-ordering approach can speed up the search with 20 to 50 percent compared with one of the best current alternatives, the history heuristic.",
author = "L. Kocsis and J. Uiterwijk and {Van Den Herik}, J.",
year = "2001",
doi = "10.1007/3-540-45517-5_6",
language = "English",
isbn = "978-3-540-42219-8",
volume = "2070",
series = "Lecture Notes in Computer Science",
publisher = "Springer, Berlin, Heidelberg",
pages = "45--50",
editor = "L. Monostori and L. V{\'a}ncza and M. Ali",
booktitle = "Engineering of Intelligent Systems. IEA/AIE 2001",
address = "Germany",
}