Randomised Evaluations in Single Agent Search

by    I. Althofer, S. Heuser

Preprint series: 05-01, Reports on Optimization

90B40 Search theory
91A46 Combinatorial games

Abstract: Most game playing programs are based on heuristic game tree search. Following an old investigation by D.F.Beal and M.C.Smith (1994), the report discusses depth-t searches with randomised evaluation functions. Experiments were done for single-agent search.
The main finding is that applying a random disturbance to the heuristic leaf values may considerably improve the playing strength.

Keywords: combinatorial games, single-agent search, heuristic evaluations

Upload: 2005-02-16

The author(s) agree, that this abstract may be stored as full text and distributed as such by abstracting services.