Connectionist Learning of Expert Backgammon Evaluations
暂无分享,去创建一个
A class of connectionist networks is described that have learned to evaluate the strength of backgammon moves. The networks were trained by “back-propagation” learning of a large set of sample positions evaluated by a human expert. A game-playing system using such a network evaluation function achieves an intermediate-to-advanced level of performance, and is significantly better than the best available commercial program. In order to achieve this level of performance, certain novel protocols for the training procedure and input coding scheme design were required. These protocols are expected to be of general utility in applications of network learning to large-scale “real-world” problems.
[1] Hans J. Berliner,et al. Backgammon Computer Program Beats World Champion , 1980 .
[2] Geoffrey E. Hinton,et al. Learning representations by back-propagating errors , 1986, Nature.
[3] John H. Holland,et al. Escaping brittleness: the possibilities of general-purpose learning algorithms applied to parallel rule-based systems , 1995 .