# Slot Machine RTP Optimization Using Variable Neighborhood Search

Authors: Pantelis-Arsenios Kamanas; Angelo Sifaleras; Nikolaos Samaras
Journal: Mathematical Problems in Engineering
 (2021)

---

## Abstract

This work presents a Variable Neighborhood Search (VNS) approach for solving the Return-To-Player (RTP) optimization problem. A large number of software companies in the gaming industry seek to solve the RTP optimization problem in order to develop modern virtual casino gambling machines. These slot machines have a number of reels (e.g., three or more) that spin once a button is pushed. Each slot machine is required to have an RTP in a particular range according to the legislation of each country. By using a VNS framework that guides two local search operators, we show how to control the distribution of the symbols in the reels in order to achieve the desired RTP. In this study, optimization refers only to base game, the core of slot machine games, and not in bonus games, since a bonus game is triggered once two, three, or more specific symbols occur in the gaming monitor. Although other researchers have tried to solve the RTP problem in the past, this is the first time that a VNS methodology is proposed for this problem in the literature with good computational results.


---

## Body

## 1. Introduction

Slot machines, also known as fruit machines, are the most popular gambling games in casinos. They are either electronic or electromechanical devices that consist of a number of reels (n) that spin independently and a screen with a number of rows (m). Each reel contains several symbols in specific arrangements and quantities. Also, it has a number of positions at which they stop, and this number is called stops [1]. The stops are being shown on the display of a slot machine, while the reels are spinning in front of the player. Slot machines as mechanical devices had cylinders as spinning reels holding the symbols that were printed on a strip. Nowadays, slot machines are mostly electronic, and they can be found either in traditional casinos or in online casinos as software. However, in virtual slots, once the reels start spinning, a Pseudo-Random Number Generator (PRNG) is used to get the stops.The display of a virtual slot machine shows the (m×n) window of the game, game rules, coin values, line bet, payout schedule, and more options. The player inserts cash or a paper ticket with a barcode in “ticket-in, ticket-out” machine. Once the player presses a button, in case the slot machine has the minimum amount of bet, the reels of the base game start spinning. After that, the reels produce the outcome of the game, which consists of all symbols that remained visible through the window on the display and the payment of the combination in pay table of these symbols that are greater than zero. If the visible window contains symbols that trigger a bonus game (e.g., free spins in base game or to another feature game), then the player has a big chance to win much more money than he/she bets.The gambling industry is one of the most profitable industries globally. With more than US$ 450 billion dollars estimated value in 2020 and with a projected value of more than US$ 640 billion by 2027, the gambling market is definitely one of the largest and most profitable in the world [2]. It is also worth mentioning that these figures are only related to the regulated markets, as the grey and black markets contribute with hundreds of billions of dollars to the total market value. There are hundreds of companies of different types of services that compose the gambling industry: from casinos and software developers to casino game developers and payment solutions. The growth of remote gaming, with online and mobile gambling market size, is expected to grow by more than 10% by 2027, ensuring that the gambling industry will become even more profitable in the years to come. Hundreds of thousands of dollars are spent every year from several companies in order to participate in exhibitions around the world, with the most famous and attractive being held in Las Vegas, Paris, London, South Africa, and Singapore. A list of the most well-known conferences and trade shows with a Gaming, Sports Betting, and Affiliate theme may be found online [3], for example, Paris Games Week, iGB Live!, and ICE Totally Gaming.Return-To-Player (RTP) is one of the two most important parameters for a player to choose if he/she is going to play the game, but it is also the main gambling game parameter which is under government regulation [4]. It is the win as percentage of the bet and is the phrase that casinos and casino game makers use to describe the long-term theoretical expected payback percentage from all wagers on a slot machine, video poker machine, or Video Lottery Terminal (VLT). If a slot machine player is going to play a hundred rounds at 1$ on a slot game with a theoretical slot RTP of 93%, with all other things being equal, he/she would expect to get a return of 93$ in wins from his staked 100$. A player wins back most of his wager. The remaining 7% of his bet, in this game, is the house edge, the money that casino earns off each bet. The formula for the computation of the RTP and also some necessary notations can be found with the formulae below:(1)RTP=Coins OutCoins In×100%,or(2)RTP=Total PrizeCycle×Paylines×100%.Total Prize: the amount of money that a window instance winsCycle: how many times the reels spun in a Monte Carlo simulationPay Lines: the number of lines that the game has enabledCoins In: total amount of coins betCoins Out: total amount of coins wonIn this paper, Monte Carlo simulation with 100,000 and 1,000,000 separate runs will be used for the RTP calculations. In simulations, formula (2) is used, where the cycle represents the number of runs. In addition, there is another type of simulation called “Full Cycle.” This latter type of simulation is used in the design phase (i.e., mathematical) of a slot machine game. It is an exhaustive cycle through all possible stop positions. The Full Cycle simulation allows an exact match to the calculations in the spreadsheet but is not capable of calculating coinciding statistics across a series of feature games.The structure of this work is as follows: In Section2, we discuss similar approaches for the RTP optimization problem, focusing on recent research work and the methods they utilize. Next, we introduce our methodology in Section 3. Section 4 presents the results of our methods on several games. Finally, we draw our conclusions and provide some research directions for future work in Section 5.


## 2. Related Work

Although the RTP optimization problem is one of the most important parts of the slot machine game design, there are not many scientific articles that present a heuristic or metaheuristic approach to solve this problem. Only three papers have been published which present a metaheuristic approach to solve the RTP optimization problem and are briefly presented in Table1.Table 1
Key literature contributions on RTP optimization.
ReferenceApproachSimulationSpecial symbolsRunsGames testedThis workVNSMonte CarloYes100,000 & 1,000,00033[4]GA(s)Monte CarloNo100,000 or 1,000,0001[5]DEMonte CarloNo1,000,0001[6]DDE and GA(s)Full CycleYesAll possible1Balabanov et al. [4] presented a solution for the slot machine RTP optimization problem, where the symbols distribution of the base game is being controlled and, also, some other features like free spins frequency or bonus game frequency. The fitness function in this work was the absolute difference between the desired RTP and the obtained RTP. For Monte Carlo simulations, 1,000,000 or 100,000 separate runs were used in order to calculate the obtained RTP. They used Genetic Algorithms (GAs), with a randomized initial population and appropriate crossover and mutation operators. The target RTP of the example that the authors presented was 99%, starting from 91%. So, the algorithm increases the RTP in a small range in case the game already exists (a quality starting RTP). However, in most cases, the mathematicians of slot games usually try to develop a new slot machine game (from scratch) that has initial reels with randomized symbol distribution and the RTP might be equal, for example, to 630% (big random value). So, it is not a trivial task for such algorithms to handle the case of large reductions and the huge difference between the target RTP and the initial RTP. The decrease of the RTP in slot machine game is the hardest problem for the mathematicians, since they have to solve the RTP optimization problem with hand adjustments and this usually requires a long time. Furthermore, the algorithm’s behavior in the case where special symbols appear in reels (e.g., wild, scatter) is also unknown.The same authors in [5] also proposed a Differential Evolution (DE) algorithm, since the problem of optimal symbols distribution on the reels is discrete and its convergence was found to be faster than GAs. Additionally, they also used Monte Carlo simulations with 1,000,000 separate runs over ten trials for better accuracy in base game. Their model of slot machine game contained only simple symbols and not scatter, wild, or bonus games (scatter represents symbols that pay everywhere on the screen and substitute all other symbols). The authors proposed a multicriteria optimization approach as future work, for the symbol frequencies, the free spins frequency, the game volatility, and the bonus game frequency.Keremedchiev et al. [6] proposed a Genetic Algorithm methodology for the RTP optimization problem, in bonus and free games frequency as parallel computing evolutionary optimization. The fitness function of base game that was used was computed with Full Cycle method instead of Monte Carlo simulations. In current algorithm, the model of slot machine game does contain as features bonus game, simple symbols that pay on each pay line, scatter symbols, and wild and bonus symbols that trigger the bonus game. This experiment, as it refers in it, showed that the use of Genetic Algorithm with exact numerical calculation of RTP as fitness function was very efficient and improved the slot game parameters by better adjustment of RTP, bonus game, and free games frequency. Finally, the biggest drawback was that the exact RTP computation was time-consuming and slowed down the optimization process. The authors also proposed a Discrete Differential Evolution (DDE) implementation as a further research.


## 3. Research Methodology

Variable Neighborhood Search (VNS) constitutes a metaheuristic solution method which is systematically changing a neighborhood structure. VNS was initially proposed by Mladenović et al. [7, 8]. Nowadays, a large number of successful VNS applications have been reported in a wide range of areas [9–13]. In this work, a Variable Neighborhood Descent (VND) heuristic schema was applied in base game’s RTP and it takes all symbols into account. The VND metaheuristic features a strong local search phase (intensification) utilizing a number of different neighborhood structures but lacks a diversification phase (shaking method) as compared to other VNS variants. The VND variant has been applied in several research works in the literature [14, 15].The proposed solution method is analytically described in the following subsections and an overview is depicted in Figure1.Figure 1
Solution process.


### 3.1. Solution Representation

A slot machine consists ofn reels where the symbols are represented by a string and are equally distributed. The solution representation is a two-dimensional array with the distribution of the symbols on each reel. For example, in case of a five-reel (number of columns) slot machine game with 48 symbols per reel (number of rows), the solution array (denoted as “Reels”) would have the dimension of 48×5.Three inputs of the proposed algorithm are (i) the maximum number of iterations as a termination criterion (also a maximum CPU solution time can be used), (ii) the target (desired) RTP of the user (RTPdes), and (iii) the allowed deviation denoted (R) from the target RTP. Usually, the computation of the precise RTP is quite difficult and, due to this reason, game developers are satisfied if the RTP belongs in a specific range. Hence, if RTPcurr∈RTPdes−R,RTPdes+R, then the algorithm stops. Assume, for example that if we are given R = 0.03, RTPdes = 0.83, and RTPcurr = 0.80, then the algorithm stops. An extra feature of the algorithm is that it allows the user to declare a minimum number of each symbol per reel. Thus, a fourth input of the proposed algorithm is an additional two-dimensional array containing the minimum number of symbols per reel and is denoted as “minNSR.” The number of columns of this array is equal to the number of reels, while its number of rows is equal to the number of distinct symbols. Thus, minNSRi,j denotes the minimum required number of occurrences of the i symbol in the j-reel.


### 3.2. Neighborhood Structures

The proposed VND methodology utilizes two neighborhood structures denoted as “RMS” and “RMC.” Both these local search operators aim to reduce the RTP as follows:(i)
RMS: initially, the symbols are sorted in ascending order based on their corresponding payments. The Replace Maximum Symbol (RMS) local search operator replaces symboli with the biggest payment by symboli−1 that has the next biggest payment in pay table. The players of a slot machine game may win a monetary award in the case where a combination of at least two identical symbols occurs in the pay lines. The symbol that has the biggest payment in these combinations is considered the most expensive symbol. However, the replacement by the RMS operator is permitted only after checking the input array minNSR (minimum number of symbols per reel requested by the game developer); otherwise, the next most expensive symboli−1 is considered for potential replacement.(ii)
RMC: the RTP increases when the placement of the symbols in the reels leads to minimum winning combinations of symbols (i.e., combinations of two identical symbols only) with a high frequency. The Replace Minimum Combination (RMC) local search operator replaces symboli which participates in a minimum winning combination with symbolj that does not participate in such winning combinations (e.g., it participates in winning combinations of three or more identical symbols). Such symbols may participate in combinations with a little larger payment, but the frequency of their combinations is much lower.


### 3.3. VND Metaheuristic Algorithm

The VND solution approach is depicted in Algorithm1. Also, Monte Carlo simulation (RunSimulation) is used for the calculation of the current RTPcurr with 100,000 or 1,000,000 separate runs. The two neighborhood structures RMS and RMC are also denoted as N1 and N2, respectively. Moreover, the number of different neighborhood structures is denoted as lmax and in this work it is equal to two.Algorithm 1: VND.
Data: RTPdes,iterationmax,R,minNSR,Reels,lmaxResult: ReelsReelcurr⟵1;RTPcurr⟵RunSimulation;Difference⟵RTPcurr−RTPdes;repeatl⟵1;repeatSelectReels′∈Nlx such that RTPReels′<RTPReels;RTPcurr⟵RunSimulation;NeighborhoodChange (Reels,Reels′,l);Reelcurr⟵Reelcurr+1modn;untill=lmax;untilstopping criterion;The proposed VND is initialized with a randomized initial symbol distribution per reel (the list of distinct symbols is given by the game developer) and terminates once a maximum number of iterations is performed rather than not finding an improvement. This is due to the fact that, in each iteration, a Monte Carlo simulation might return an approximate value of the RTP and not the exact RTP that would result after a (time-consuming) Full Cycle RTP computation. Thus, in some cases, although the two local search operators do not make any improvement, a better RTP value can be calculated by the Monte Carlo simulations. Moreover, each time the neighborhood is changed, the search is performed in a different (next) reel. Thus, the VND starts the optimization using the first reel (Reelcurr=1) and afterward sequentially applies the local search operators in each one of the n reels.


### 3.4. Illustrative Examples

Without loss of generality, let us assume a hypothetical slot machine game withn reels, with each one of them containing 12 equally distributed symbols. The symbols are represented as string variables in an array (R) and the pay table is stored as integer values in another array (P).(3)P=02416640083212800832128001664512.Next, an example of theminNSR array is presented, where for simplicity we show only one of the columns corresponding only to the first reel. Each index represents how many of sym0i symbols should remain in current reel and not get replaced by other, for example, minNSR2=3 meaning that sym02 cannot occur less than three times in the first reel. This way, it will not be possible to replace sym02 with sym03.(4)minNSRT=2311.TheRMC operator changes the symbols of the first reel as follows:(5)sym01sym02sym02sym02sym01sym01sym03sym02sym01sym03sym01sym04sym04⇒sym02sym02sym02sym02sym01sym01sym03sym02sym01sym03sym01sym04sym04.Thei-row of the pay table contains the payments of each symbol sym0i (arrays start from one) for combinations of one, two, three, four, and five, respectively, for example, sym03’s payment takes place in the third row of pay table P3. The RMC local search operator replaces sym01 with sym02.If theRMS operator was applied, then sym04, that is, the most expensive symbol according to pay table (combination of five pays 512), will be replaced by sym03 which is the next most expensive but cheaper than this symbol. So, in the first reel sym04 will be replaced by sym03 as follows:(6)sym01sym02sym02sym02sym01sym01sym03sym02sym01sym03sym01sym04sym04⇒sym01sym02sym02sym02sym01sym01sym03sym02sym01sym03sym01sym04sym03.


## 3.1. Solution Representation

A slot machine consists ofn reels where the symbols are represented by a string and are equally distributed. The solution representation is a two-dimensional array with the distribution of the symbols on each reel. For example, in case of a five-reel (number of columns) slot machine game with 48 symbols per reel (number of rows), the solution array (denoted as “Reels”) would have the dimension of 48×5.Three inputs of the proposed algorithm are (i) the maximum number of iterations as a termination criterion (also a maximum CPU solution time can be used), (ii) the target (desired) RTP of the user (RTPdes), and (iii) the allowed deviation denoted (R) from the target RTP. Usually, the computation of the precise RTP is quite difficult and, due to this reason, game developers are satisfied if the RTP belongs in a specific range. Hence, if RTPcurr∈RTPdes−R,RTPdes+R, then the algorithm stops. Assume, for example that if we are given R = 0.03, RTPdes = 0.83, and RTPcurr = 0.80, then the algorithm stops. An extra feature of the algorithm is that it allows the user to declare a minimum number of each symbol per reel. Thus, a fourth input of the proposed algorithm is an additional two-dimensional array containing the minimum number of symbols per reel and is denoted as “minNSR.” The number of columns of this array is equal to the number of reels, while its number of rows is equal to the number of distinct symbols. Thus, minNSRi,j denotes the minimum required number of occurrences of the i symbol in the j-reel.


## 3.2. Neighborhood Structures

The proposed VND methodology utilizes two neighborhood structures denoted as “RMS” and “RMC.” Both these local search operators aim to reduce the RTP as follows:(i)
RMS: initially, the symbols are sorted in ascending order based on their corresponding payments. The Replace Maximum Symbol (RMS) local search operator replaces symboli with the biggest payment by symboli−1 that has the next biggest payment in pay table. The players of a slot machine game may win a monetary award in the case where a combination of at least two identical symbols occurs in the pay lines. The symbol that has the biggest payment in these combinations is considered the most expensive symbol. However, the replacement by the RMS operator is permitted only after checking the input array minNSR (minimum number of symbols per reel requested by the game developer); otherwise, the next most expensive symboli−1 is considered for potential replacement.(ii)
RMC: the RTP increases when the placement of the symbols in the reels leads to minimum winning combinations of symbols (i.e., combinations of two identical symbols only) with a high frequency. The Replace Minimum Combination (RMC) local search operator replaces symboli which participates in a minimum winning combination with symbolj that does not participate in such winning combinations (e.g., it participates in winning combinations of three or more identical symbols). Such symbols may participate in combinations with a little larger payment, but the frequency of their combinations is much lower.


## 3.3. VND Metaheuristic Algorithm

The VND solution approach is depicted in Algorithm1. Also, Monte Carlo simulation (RunSimulation) is used for the calculation of the current RTPcurr with 100,000 or 1,000,000 separate runs. The two neighborhood structures RMS and RMC are also denoted as N1 and N2, respectively. Moreover, the number of different neighborhood structures is denoted as lmax and in this work it is equal to two.Algorithm 1: VND.
Data: RTPdes,iterationmax,R,minNSR,Reels,lmaxResult: ReelsReelcurr⟵1;RTPcurr⟵RunSimulation;Difference⟵RTPcurr−RTPdes;repeatl⟵1;repeatSelectReels′∈Nlx such that RTPReels′<RTPReels;RTPcurr⟵RunSimulation;NeighborhoodChange (Reels,Reels′,l);Reelcurr⟵Reelcurr+1modn;untill=lmax;untilstopping criterion;The proposed VND is initialized with a randomized initial symbol distribution per reel (the list of distinct symbols is given by the game developer) and terminates once a maximum number of iterations is performed rather than not finding an improvement. This is due to the fact that, in each iteration, a Monte Carlo simulation might return an approximate value of the RTP and not the exact RTP that would result after a (time-consuming) Full Cycle RTP computation. Thus, in some cases, although the two local search operators do not make any improvement, a better RTP value can be calculated by the Monte Carlo simulations. Moreover, each time the neighborhood is changed, the search is performed in a different (next) reel. Thus, the VND starts the optimization using the first reel (Reelcurr=1) and afterward sequentially applies the local search operators in each one of the n reels.


## 3.4. Illustrative Examples

Without loss of generality, let us assume a hypothetical slot machine game withn reels, with each one of them containing 12 equally distributed symbols. The symbols are represented as string variables in an array (R) and the pay table is stored as integer values in another array (P).(3)P=02416640083212800832128001664512.Next, an example of theminNSR array is presented, where for simplicity we show only one of the columns corresponding only to the first reel. Each index represents how many of sym0i symbols should remain in current reel and not get replaced by other, for example, minNSR2=3 meaning that sym02 cannot occur less than three times in the first reel. This way, it will not be possible to replace sym02 with sym03.(4)minNSRT=2311.TheRMC operator changes the symbols of the first reel as follows:(5)sym01sym02sym02sym02sym01sym01sym03sym02sym01sym03sym01sym04sym04⇒sym02sym02sym02sym02sym01sym01sym03sym02sym01sym03sym01sym04sym04.Thei-row of the pay table contains the payments of each symbol sym0i (arrays start from one) for combinations of one, two, three, four, and five, respectively, for example, sym03’s payment takes place in the third row of pay table P3. The RMC local search operator replaces sym01 with sym02.If theRMS operator was applied, then sym04, that is, the most expensive symbol according to pay table (combination of five pays 512), will be replaced by sym03 which is the next most expensive but cheaper than this symbol. So, in the first reel sym04 will be replaced by sym03 as follows:(6)sym01sym02sym02sym02sym01sym01sym03sym02sym01sym03sym01sym04sym04⇒sym01sym02sym02sym02sym01sym01sym03sym02sym01sym03sym01sym04sym03.


## 4. Experimental Results

All the computational experiments have been done using a Dell Inspiron 5558 laptop with an Intel Core i5-5200U CPU at 2.20 GHz, 8 GB DDR3 RAM at 1600 MHz, and running 64-bit Microsoft Windows 10 Professional. The experiments have been done using three commercial slot machine games developed by the Zeusplay (https://zeusplay.com) casino game developer company.Le Mystere Du Prince [16], a five-reel slot machine game with wild and scatter as special symbolsAmun’s Book [17], a five-reel slot machine game that holds one special symbol called book and acts as a wild and scatterWild Charger [18], a five-reel slot machine game that holds one wild and acts as expanding and sticky at the same time (symbol developed by Zeusplay)All the above games have ten pay lines (winning lines) and they are all paid from left to right. The smaller winning is two monetary units for a combination of two symbols for each game. The details (e.g., pay table, symbols) of the first slot machine game are presented below:(7)P=0252510000525100005251000052510000105012500157525000157525000201004000225125750022512575002050200500001025025009000.In this game, special symbols wild and scatter are included. The distinct symbols of the game are(8)S=sym01sym02sym03sym04sym05sym06sym07sym08sym09sym10sym11scatterwild.EachSi refers to payments of Pi element for one, two, three, four, and five combinations of this symbol. The only differences with the other two games, in base game, are the pay table and the number of distinct symbols. Amun’s Book and Wild Charger consist of ten and eight symbols, respectively. The minNSR array for these two games has been set the same as Le Mystere Du Prince’s.(9)minNSR=11111....................11111.According to the aboveminNSR table, at least one symbol on each reel must exist. In the tables below, all the necessary information about the optimization is presented, such as the number of separate runs with Monte Carlo simulation, the target RTP, the initial RTP, and the RTP that was finally obtained. The allowed deviation for the RTP (R variable) was set equal to 3% for the first game, meaning that if 77% ≤RTPcurr≤ 83%, then the algorithm terminates since a good solution was found. The output is a set of reels with the modified symbols and the best RTP that has been found. For the second game and the third game, the R value was set equal to 2% and 1%, respectively. These three games are presented in order to show that the algorithm can indeed optimize games with either large or small difference between the initial RTP and the target RTP. The RTP of the first game was decreased from 715% to 80%, while the RTP of the second game was decreased from 57% to 40%, and the RTP of the third game was decreased from 107% to 53%, approximately. The results per game are presented in Tables 2–4, respectively.Table 2
Le Mystere Du Prince.
RunsRTP initial (%)RTP target (%)RTP obtained (%)100,000718.37477–8382.0251,000,000712.66177–8378,996Table 3
Wild Charger.
RunsRTP initial (%)RTP target (%)RTP obtained (%)100,00056.10538–4241.2771,000,00057.22638–4238.758Table 4
Amun’s Book.
RunsRTP initial (%)RTP target (%)RTP obtained (%)100,000111.00552–5452.0151,000,000104.85252–5452.803The required solution time and number of iterations are presented in Table5.Table 5
Results for the three games.
GameSimulation runsTime (secs)IterationsLe Mystere Du Prince100,0003532456Le Mystere Du Prince1,000,000786501Wild Charger100,00022062Wild Charger1,000,00015350Amun’s Book100,00035110Amun’s Book1,000,000223149TheRTP reduction through the whole process of optimization for each iteration of each game is presented in Figures 2–7. It can be noticed that Monte Carlo simulation with 1,000,000 separate runs is more precise and needs less iterations to find one acceptable solution rather than the version with 100,000 separate runs. That happens since the larger the sample (runs) is, the more exact the results will be. A larger sample always leads to more reliable results.Figure 2
Le Mystere Du Prince: 100,000 runs.Figure 3
Le Mystere Du Prince: 1,000,000 runs.Figure 4
Amun’s Book: 100,000 runs.Figure 5
Amun’s Book: 1,000,000 runs.Figure 6
Wild Charger: 100,000 runs.Figure 7
Wild Charger: 1,000,000 runs.Also, it can be noticed that Amun’s BookRTP needs 110 iterations to finish for 100,000 runs and 149 iterations for 1,000,000. The difference with the other two games which makes these big changes in RTP is due to the fact that the wild symbol is also a scatter, so once the wild symbol is modified to another simple symbol, the RTP rapidly decreases.Creating an exciting as well as attractive slot game, consists of a variety of elements, depending on the target group. There are several types of players, some of which prefer to risk on a game that might not return much when in base game, but they have a bonus feature that is more likely to return big wins. In order to create such games, a combination of acceptable pay tables, hit rates, and bonus feature triggering frequency must be taken in consideration. The most common logic is to have a risky base game, with a lowRTP but with recurring small wins, so that the player does not immediately lose his/her money, which triggers a bonus feature more frequently and gives the player the confidence that he/she is able to win big prizes.


## 5. Conclusions and Future Work

The experiments showed that the use of VNS was very efficient in developing slot games from scratch, where the symbol distribution is not uniform. As shown in the figures of the previous section, the required number of iterations of the proposed method depends on the initial difference between the initialRTP and target RTP. Also, in cases where a symbol contains two types of special symbols (e.g., such as in the second game where the “scatter” symbol is also a “wild” symbol), a large RTP decrease can be achieved by converting this symbol to another.As the complexity of games increases, the required solution time increases too, and this fact shows the need for speeding up the whole process. As future research, an implementation of much more complex gamesRTP can be proposed using parallel CPU and GPU computing techniques to decrease the computational time for finding an acceptable (RTP) solution. Furthermore, the proposed algorithm is a single-criterion approach for the RTP optimization. Another research idea is to develop a multicriteria method for optimizing RTP, volatility, and hit rate (i.e., how frequently a player is expected to stop on a winning combination).



---

*Source: 8784065-2021-05-05.xml*