UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Bootstrapping from game tree search

Veness, J; Silver, D; Uther, W; Blair, A; (2009) Bootstrapping from game tree search. In: (pp. pp. 1937-1945).

Full text not available from this repository.


In this paper we introduce a new algorithm for updating the parameters of a heuristic evaluation function, by updating the heuristic towards the values computed by an alpha-beta search. Our algorithm differs from previous approaches to learning from search, such as Samuel's checkers player and the TD-Leaf algorithm, in two key ways. First, we update all nodes in the search tree, rather than a single node. Second, we use the outcome of a deep search, instead of the outcome of a subsequent search, as the training signal for the evaluation function. We implemented our algorithm in a chess program Meep, using a linear heuristic function. After initialising its weight vector to small random values, Meep was able to learn high quality weights from self-play alone. When tested online against human opponents, Meep played at a master level, the best performance of any chess program with a heuristic learned entirely from self-play.

Type: Proceedings paper
Title: Bootstrapping from game tree search
ISBN-13: 9781615679119
URI: http://discovery.ucl.ac.uk/id/eprint/1347363
Downloads since deposit
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item