RSPSA: Enhanced Parameter Optimisation in Games

L. Kocsis*, C.S. Szepesvari, M.H.M. Winands

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterAcademic

5 Citations (Web of Science)


Most game programs have a large number of parameters that are crucial for their performance. Tuning these parameters by hand is rather difficult. Therefore automatic optimization algorithms in game programs are interesting research domains. However, successful applications are only known for parameters that belong to certain components (e.g., evaluation-function parameters). The spsa (simultaneous perturbation stochastic approximation) algorithm is an attractive choice for optimizing any kind of parameters of a game program, both for its generality and its simplicity. Its disadvantage is that it can be very this article we propose several methods to speed up spsa, in particular, the combination with rprop, using common random numbers, antithetic variables, and averaging. We test the resulting algorithm for tuning various types of parameters in two domains, poker and loa. From the experimental study, we may conclude that using spsa is a viable approach for optimization in game programs, in particular if no good alternative exists for the types of parameters considered.
Original languageEnglish
Title of host publicationAdvances in Computer Games. ACG 2005.
EditorsH.J. van den Herik, S.C. Hsu, H.H.L.M. Donkers
Place of PublicationHeidelberg
ISBN (Electronic)978-3-540-48889-7
ISBN (Print)978-3-540-48887-3
Publication statusPublished - 1 Jan 2006

Publication series

SeriesLecture Notes in Computer Science

Cite this