Skip to main content

Slot Machines RTP Optimization with Genetic Algorithms

  • Conference paper
  • First Online:
Numerical Methods and Applications (NMA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8962))

Included in the following conference series:

Abstract

Slot machine RTP optimization problem is usually solved by hand adjustment of the symbols placed on the game reels. By controlling the symbols distribution, it is possible to achieve the desired return to player percent (RTP). Some other parameters can also be adjusted (for example, the free spins frequency or the bonus game frequency). In this paper RTP optimization automation, based on genetic algorithms, is proposed.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Brysbaert, M.: Algorithms for randomness in the behavioral sciences: a tutorial. Behav. Res. Methods Instrum. Comput. 22(1), 45–60 (1991)

    Article  Google Scholar 

  2. Parke, J., Griffiths, M.: The psychology of the fruit machine: the role of structural characteristics (revisited). In: Paper Presented at the Annual Conference of the British Psychological Society, Surrey, England (2001)

    Google Scholar 

  3. Osesa, N.: Bitz and Pizzas optimal stopping strategy for a slot machine bonus game. OR Insight 22, 31–44 (2009)

    Article  Google Scholar 

  4. Eiben, A.E: Genetic algorithms with multi-parent recombination. In: PPSN III: Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature, pp. 78–87 (1994). ISBN 3-540-58484-6

    Google Scholar 

  5. Ting, C.-K.: On the mean convergence time of multi-parent genetic algorithms without selection. In: Capcarrère, M.S., Freitas, A.A., Bentley, P.J., Johnson, C.G., Timmis, J. (eds.) ECAL 2005. LNCS (LNAI), vol. 3630, pp. 403–412. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Balabanov, T: Slot Genetic Algorithm. http://drive.google.com/file/d/0Bz5a6NKy7qNiYi1jS01ZVnFOV1U

Download references

Acknowledgements

This research is supported by AComIn “Advanced Computing for Innovation”, Grant 316087, sponsored by FP7 Capacity Programme, Research Potential of Convergence Regions (2012–2016), the European Social Fund and the Republic of Bulgaria, the Operational Programme Development of Human Resources 20072013, Grant BG051PO001-3.3.06-0048 from 04.10.2012.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Todor Balabanov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Balabanov, T., Zankinski, I., Shumanov, B. (2015). Slot Machines RTP Optimization with Genetic Algorithms. In: Dimov, I., Fidanova, S., Lirkov, I. (eds) Numerical Methods and Applications. NMA 2014. Lecture Notes in Computer Science(), vol 8962. Springer, Cham. https://doi.org/10.1007/978-3-319-15585-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-15585-2_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-15584-5

  • Online ISBN: 978-3-319-15585-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics