├── .gitignore ├── BingoSlotDifferentialEvolutionOptimization.csproj ├── BingoSlotDifferentialEvolutionOptimization.sln ├── BingoSlotDifferentialEvolutionOptimization.userprefs ├── DiscreteDifferentialEvolution.cs ├── LICENSE ├── Paytable.cs ├── Program.cs ├── Properties └── AssemblyInfo.cs ├── README.md ├── SlotMachineSimulation.cs ├── Symbols.cs ├── Util.cs └── format.sh /.gitignore: -------------------------------------------------------------------------------- 1 | ## Ignore Visual Studio temporary files, build results, and 2 | ## files generated by popular Visual Studio add-ons. 3 | 4 | # User-specific files 5 | *.suo 6 | *.user 7 | *.sln.docstates 8 | 9 | # Build results 10 | [Dd]ebug/ 11 | [Dd]ebugPublic/ 12 | [Rr]elease/ 13 | [Rr]eleases/ 14 | x64/ 15 | x86/ 16 | build/ 17 | bld/ 18 | [Bb]in/ 19 | [Oo]bj/ 20 | 21 | # Roslyn cache directories 22 | *.ide/ 23 | 24 | # MSTest test Results 25 | [Tt]est[Rr]esult*/ 26 | [Bb]uild[Ll]og.* 27 | 28 | #NUNIT 29 | *.VisualState.xml 30 | TestResult.xml 31 | 32 | # Build Results of an ATL Project 33 | [Dd]ebugPS/ 34 | [Rr]eleasePS/ 35 | dlldata.c 36 | 37 | *_i.c 38 | *_p.c 39 | *_i.h 40 | *.ilk 41 | *.meta 42 | *.obj 43 | *.pch 44 | *.pdb 45 | *.pgc 46 | *.pgd 47 | *.rsp 48 | *.sbr 49 | *.tlb 50 | *.tli 51 | *.tlh 52 | *.tmp 53 | *.tmp_proj 54 | *.log 55 | *.vspscc 56 | *.vssscc 57 | .builds 58 | *.pidb 59 | *.svclog 60 | *.scc 61 | 62 | # Chutzpah Test files 63 | _Chutzpah* 64 | 65 | # Visual C++ cache files 66 | ipch/ 67 | *.aps 68 | *.ncb 69 | *.opensdf 70 | *.sdf 71 | *.cachefile 72 | 73 | # Visual Studio profiler 74 | *.psess 75 | *.vsp 76 | *.vspx 77 | 78 | # TFS 2012 Local Workspace 79 | $tf/ 80 | 81 | # Guidance Automation Toolkit 82 | *.gpState 83 | 84 | # ReSharper is a .NET coding add-in 85 | _ReSharper*/ 86 | *.[Rr]e[Ss]harper 87 | *.DotSettings.user 88 | 89 | # JustCode is a .NET coding addin-in 90 | .JustCode 91 | 92 | # TeamCity is a build add-in 93 | _TeamCity* 94 | 95 | # DotCover is a Code Coverage Tool 96 | *.dotCover 97 | 98 | # NCrunch 99 | _NCrunch_* 100 | .*crunch*.local.xml 101 | 102 | # MightyMoose 103 | *.mm.* 104 | AutoTest.Net/ 105 | 106 | # Web workbench (sass) 107 | .sass-cache/ 108 | 109 | # Installshield output folder 110 | [Ee]xpress/ 111 | 112 | # DocProject is a documentation generator add-in 113 | DocProject/buildhelp/ 114 | DocProject/Help/*.HxT 115 | DocProject/Help/*.HxC 116 | DocProject/Help/*.hhc 117 | DocProject/Help/*.hhk 118 | DocProject/Help/*.hhp 119 | DocProject/Help/Html2 120 | DocProject/Help/html 121 | 122 | # Click-Once directory 123 | publish/ 124 | 125 | # Publish Web Output 126 | *.[Pp]ublish.xml 127 | *.azurePubxml 128 | # TODO: Comment the next line if you want to checkin your web deploy settings 129 | # but database connection strings (with potential passwords) will be unencrypted 130 | *.pubxml 131 | *.publishproj 132 | 133 | # NuGet Packages 134 | *.nupkg 135 | # The packages folder can be ignored because of Package Restore 136 | **/packages/* 137 | # except build/, which is used as an MSBuild target. 138 | !**/packages/build/ 139 | # If using the old MSBuild-Integrated Package Restore, uncomment this: 140 | #!**/packages/repositories.config 141 | 142 | # Windows Azure Build Output 143 | csx/ 144 | *.build.csdef 145 | 146 | # Windows Store app package directory 147 | AppPackages/ 148 | 149 | # Others 150 | sql/ 151 | *.Cache 152 | ClientBin/ 153 | [Ss]tyle[Cc]op.* 154 | ~$* 155 | *~ 156 | *.dbmdl 157 | *.dbproj.schemaview 158 | *.pfx 159 | *.publishsettings 160 | node_modules/ 161 | 162 | # RIA/Silverlight projects 163 | Generated_Code/ 164 | 165 | # Backup & report files from converting an old project file 166 | # to a newer Visual Studio version. Backup files are not needed, 167 | # because we have git ;-) 168 | _UpgradeReport_Files/ 169 | Backup*/ 170 | UpgradeLog*.XML 171 | UpgradeLog*.htm 172 | 173 | # SQL Server files 174 | *.mdf 175 | *.ldf 176 | 177 | # Business Intelligence projects 178 | *.rdl.data 179 | *.bim.layout 180 | *.bim_*.settings 181 | 182 | # Microsoft Fakes 183 | FakesAssemblies/ 184 | 185 | # Mac OS X 186 | .DS_Store 187 | -------------------------------------------------------------------------------- /BingoSlotDifferentialEvolutionOptimization.csproj: -------------------------------------------------------------------------------- 1 | 2 | 3 | 4 | Debug 5 | x86 6 | 8.0.30703 7 | 2.0 8 | {CF73F52C-87A0-412A-A0DE-A3255711DA17} 9 | Exe 10 | BingoSlotDifferentialEvolutionOptimization 11 | BingoSlotDifferentialEvolutionOptimization 12 | 13 | 14 | true 15 | full 16 | false 17 | bin\Debug 18 | DEBUG; 19 | prompt 20 | 4 21 | true 22 | x86 23 | 24 | 25 | full 26 | true 27 | bin\Release 28 | prompt 29 | 4 30 | true 31 | x86 32 | 33 | 34 | 35 | 36 | 37 | 38 | 39 | 40 | 41 | 42 | 43 | 44 | 45 | 46 | 47 | 48 | -------------------------------------------------------------------------------- /BingoSlotDifferentialEvolutionOptimization.sln: -------------------------------------------------------------------------------- 1 |  2 | Microsoft Visual Studio Solution File, Format Version 11.00 3 | # Visual Studio 2010 4 | Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "BingoSlotDifferentialEvolutionOptimization", "BingoSlotDifferentialEvolutionOptimization.csproj", "{CF73F52C-87A0-412A-A0DE-A3255711DA17}" 5 | EndProject 6 | Global 7 | GlobalSection(SolutionConfigurationPlatforms) = preSolution 8 | Debug|x86 = Debug|x86 9 | Release|x86 = Release|x86 10 | EndGlobalSection 11 | GlobalSection(ProjectConfigurationPlatforms) = postSolution 12 | {CF73F52C-87A0-412A-A0DE-A3255711DA17}.Debug|x86.ActiveCfg = Debug|x86 13 | {CF73F52C-87A0-412A-A0DE-A3255711DA17}.Debug|x86.Build.0 = Debug|x86 14 | {CF73F52C-87A0-412A-A0DE-A3255711DA17}.Release|x86.ActiveCfg = Release|x86 15 | {CF73F52C-87A0-412A-A0DE-A3255711DA17}.Release|x86.Build.0 = Release|x86 16 | EndGlobalSection 17 | EndGlobal 18 | -------------------------------------------------------------------------------- /BingoSlotDifferentialEvolutionOptimization.userprefs: -------------------------------------------------------------------------------- 1 |  2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | -------------------------------------------------------------------------------- /DiscreteDifferentialEvolution.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | using System.Diagnostics; 3 | using System.Globalization; 4 | 5 | namespace BingoSlotDifferentialEvolutionOptimization { 6 | class DiscreteDifferentialEvolution { 7 | public const long NUMBER_OF_RECOMBINATIONS = 1000; 8 | 9 | public const int POPULATION_SIZE = 17; 10 | 11 | public const int NUMBER_OF_REELS = 5; 12 | 13 | public const int REEL_LENGTH = 63; 14 | 15 | private double targetRtp; 16 | 17 | private int symbolsDiversity; 18 | 19 | private double[] fitness = new double[ POPULATION_SIZE ]; 20 | 21 | private int[][][] population = new int[POPULATION_SIZE][][]; 22 | 23 | private int[][] offspring = null; 24 | 25 | private int targetIndex = -1; 26 | 27 | private int baseIndex = -1; 28 | 29 | private int aIndex = -1; 30 | 31 | private int bIndex = -1; 32 | 33 | private int bestIndex = -1; 34 | 35 | public int[][] best() { 36 | return population[bestIndex]; 37 | } 38 | 39 | public void select () { 40 | do { 41 | targetIndex = Util.prng.Next (population.Length); 42 | baseIndex = Util.prng.Next (population.Length); 43 | aIndex = Util.prng.Next (population.Length); 44 | bIndex = Util.prng.Next (population.Length); 45 | } while(targetIndex == baseIndex || targetIndex == aIndex || targetIndex == bIndex || baseIndex == aIndex || baseIndex == bIndex || aIndex == bIndex); 46 | } 47 | 48 | public void differs () { 49 | int min = int.MaxValue; 50 | int max = int.MinValue; 51 | for (int i = 0; i < offspring.Length; i++) { 52 | for (int j = 0; j < offspring [i].Length; j++) { 53 | offspring [i] [j] = population [aIndex] [i] [j] - population [bIndex] [i] [j]; 54 | if (min > offspring [i] [j]) { 55 | min = offspring [i] [j]; 56 | } 57 | if (max < offspring [i] [j]) { 58 | max = offspring [i] [j]; 59 | } 60 | } 61 | } 62 | 63 | /* 64 | * Normalize. 65 | */ 66 | for (int i = 0; i < offspring.Length; i++) { 67 | for (int j = 0; j < offspring [i].Length; j++) { 68 | offspring [i] [j] -= min; 69 | if (min < max) { 70 | offspring [i] [j] = 3 * offspring [i] [j] / (max - min + 1) - 1; 71 | } 72 | } 73 | } 74 | } 75 | 76 | public void mutate () { 77 | for (int i = 0; i < offspring.Length; i++) { 78 | for (int j = 0; j < offspring [i].Length; j++) { 79 | offspring [i] [j] += population [baseIndex] [i] [j]; 80 | } 81 | } 82 | 83 | /* 84 | * Validate reels. 85 | */ 86 | for (int i = 0; i < offspring.Length; i++) { 87 | for (int j = 0; j < offspring [i].Length; j++) { 88 | if (Symbols.isValid (offspring [i] [j]) == false) { 89 | offspring [i] [j] = Symbols.randomValid (); 90 | } 91 | } 92 | } 93 | } 94 | 95 | public void crossover () { 96 | for (int i = 0; i < offspring.Length; i++) { 97 | for (int j = 0; j < offspring [i].Length; j++) { 98 | if (Util.prng.NextDouble () < 0.5) { 99 | offspring [i] [j] = population [targetIndex] [i] [j]; 100 | } 101 | } 102 | } 103 | } 104 | 105 | public void survive () { 106 | SlotMachineSimulation simulation = null; 107 | 108 | /* 109 | * Re-evaluate target. 110 | */ 111 | if(Util.REEVALUATE_TARGET_VECTOR == true) { 112 | simulation = new SlotMachineSimulation (); 113 | simulation.load (population [targetIndex]); 114 | simulation.simulate (symbolsDiversity); 115 | fitness [targetIndex] = simulation.costFunction (targetRtp, symbolsDiversity); 116 | 117 | if (fitness [bestIndex] > fitness [targetIndex]) { 118 | bestIndex = targetIndex; 119 | } 120 | } 121 | 122 | /* 123 | * Evaluate new solution. 124 | */ 125 | simulation = new SlotMachineSimulation (); 126 | simulation.load (offspring); 127 | simulation.simulate (symbolsDiversity); 128 | double cost = simulation.costFunction (targetRtp, symbolsDiversity); 129 | 130 | /* 131 | * If better solution is not found - exit. 132 | */ 133 | if (cost >= fitness [targetIndex]) { 134 | return; 135 | } 136 | 137 | fitness [targetIndex] = cost; 138 | 139 | for (int i = 0; i < offspring.Length; i++) { 140 | for (int j = 0; j < offspring [i].Length; j++) { 141 | population [targetIndex] [i] [j] = offspring [i] [j]; 142 | } 143 | } 144 | 145 | if (fitness [bestIndex] > fitness [targetIndex]) { 146 | bestIndex = targetIndex; 147 | } 148 | } 149 | 150 | public void optimize () { 151 | for (int r = 0; r < NUMBER_OF_RECOMBINATIONS; r++) { 152 | Stopwatch watch = Stopwatch.StartNew (); 153 | select (); 154 | differs (); 155 | mutate (); 156 | crossover (); 157 | survive (); 158 | //TODO Remove absolutely identical individuals from the population. 159 | watch.Stop (); 160 | 161 | if (Util.VERBOSE == true) { 162 | Console.WriteLine (targetRtp); 163 | CultureInfo ci = new CultureInfo ("en-us"); 164 | Console.WriteLine ("{0}:{1}:{2}", ((int)watch.Elapsed.TotalHours).ToString ("D2", ci), ((int)watch.Elapsed.TotalMinutes % 60).ToString ("D2", ci), ((int)watch.Elapsed.TotalSeconds % 60).ToString ("D2", ci)); 165 | Console.WriteLine (this); 166 | } 167 | } 168 | } 169 | 170 | public void initialSinglePoint(int[][] reels) { 171 | for (int p = 0; p < population.Length; p++) { 172 | for (int i = 0; i < reels.Length; i++) { 173 | for (int j = 0; j < reels [i].Length; j++) { 174 | population [p] [i] [j] = reels [i] [j]; 175 | } 176 | } 177 | } 178 | 179 | /* 180 | * Move around, but keep the first unchanged. 181 | */ 182 | for (int p = 1; p < population.Length; p++) { 183 | for (int i = 0; i < reels.Length; i++) { 184 | for (int j = 0; j < reels [i].Length; j++) { 185 | int q = Util.prng.Next (reels [i].Length); 186 | int swap = population [p] [i] [q]; 187 | population [p] [i] [q] = population [p] [i] [j]; 188 | population [p] [i] [j] = swap; 189 | } 190 | } 191 | } 192 | } 193 | 194 | public void initialRandomPoints() { 195 | for (int p = 0; p < population.Length; p++) { 196 | for (int i = 0; i < population [p].Length; i++) { 197 | for (int j = 0; j < population [p] [i].Length; j++) { 198 | population [p] [i] [j] = Symbols.randomValid(); 199 | } 200 | } 201 | } 202 | } 203 | 204 | public DiscreteDifferentialEvolution (int[][] reels, double targetRtp, int symbolsDiversity) { 205 | if (reels.Length != NUMBER_OF_REELS) { 206 | Console.WriteLine ("Number of reals is incorrect!"); 207 | return; 208 | } 209 | 210 | for (int i = 0; i < reels.Length; i++) { 211 | if (reels [i].Length != REEL_LENGTH) { 212 | Console.WriteLine ("Reel length is incorrect!"); 213 | return; 214 | } 215 | } 216 | 217 | for (int p = 0; p < POPULATION_SIZE; p++) { 218 | population [p] = new int[NUMBER_OF_REELS] []; 219 | for (int i = 0; i < NUMBER_OF_REELS; i++) { 220 | population [p] [i] = new int[REEL_LENGTH]; 221 | } 222 | } 223 | 224 | offspring = new int[NUMBER_OF_REELS] []; 225 | for (int i = 0; i < NUMBER_OF_REELS; i++) { 226 | offspring [i] = new int[REEL_LENGTH]; 227 | } 228 | 229 | this.targetRtp = targetRtp; 230 | this.symbolsDiversity = symbolsDiversity; 231 | 232 | if(Util.RANDOM_INITIAL_REELS == true){ 233 | initialRandomPoints(); 234 | } else { 235 | initialSinglePoint(reels); 236 | } 237 | 238 | /* 239 | * Just put a big number (bad fitness), when there is no evaluation. 240 | */ 241 | for (int p = 0; p < population.Length; p++) { 242 | fitness [p] = int.MaxValue; 243 | } 244 | 245 | /* 246 | * Evaluate population fintess. 247 | */ 248 | bestIndex = 0; 249 | for (int p = 0; p < population.Length; p++) { 250 | /* 251 | * It will be evaluated in the first surviver. 252 | */ 253 | if(Util.REEVALUATE_TARGET_VECTOR == true) { 254 | break; 255 | } 256 | 257 | SlotMachineSimulation simulation = new SlotMachineSimulation (); 258 | simulation.load (population [p]); 259 | simulation.simulate (symbolsDiversity); 260 | fitness [p] = simulation.costFunction (targetRtp, symbolsDiversity); 261 | if (fitness [bestIndex] > fitness [p]) { 262 | bestIndex = p; 263 | } 264 | } 265 | } 266 | 267 | public override string ToString () { 268 | string result = ""; 269 | 270 | for (int p = 0; p < population.Length; p++) { 271 | if (p != bestIndex) { 272 | continue; 273 | } 274 | 275 | result += fitness [p]; 276 | result += "\r\n"; 277 | for (int i = 0; i < population [p].Length; i++) { 278 | result += "new int[] {"; 279 | for (int j = 0; j < population [p] [i].Length; j++) { 280 | result += population [p] [i] [j]; 281 | result += ","; 282 | //result += "\t"; 283 | } 284 | result += "},"; 285 | result += "\r\n"; 286 | } 287 | } 288 | 289 | return result; 290 | } 291 | } 292 | } 293 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) {year} {name of author} 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | {project} Copyright (C) {year} {fullname} 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | 676 | -------------------------------------------------------------------------------- /Paytable.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | 3 | namespace BingoSlotDifferentialEvolutionOptimization { 4 | class Paytable { 5 | /** 6 | * Slot game paytable. 7 | */ 8 | public static int[][] values = { 9 | new int[]{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 10 | new int[]{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 11 | new int[]{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 12 | new int[]{ 0, 0, 0, 500, 150, 100, 75, 25, 15, 9, 6, 3, 1, 0, 0, 0, 0 }, 13 | new int[]{ 0, 0, 0, 750, 500, 150, 100, 75, 25, 15, 10, 7, 3, 0, 0, 0, 0 }, 14 | new int[]{ 0, 0, 0, 950, 750, 500, 150, 100, 75, 50, 30, 20, 10, 0, 0, 0, 0 }, 15 | }; 16 | } 17 | } 18 | 19 | -------------------------------------------------------------------------------- /Program.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | 3 | namespace BingoSlotDifferentialEvolutionOptimization { 4 | class MainClass { 5 | public static void Main (string[] args) { 6 | double[] targets = {0.90, 0.91, 0.92, 0.93, 0.94, 0.95, 0.96, 0.97, 0.98, 0.99}; 7 | 8 | int[][][] reels = { 9 | /* 90% */ 10 | new int[][] { 11 | new int[] {10,12,6,4,7,10,4,5,7,12,6,9,3,5,8,10,9,6,11,8,10,4,7,9,4,12,3,7,11,6,10,5,4,8,11,3,8,10,11,5,7,4,6,9,3,10,11,9,5,4,3,6,12,7,6,4,7,5,8,10,11,5,8,}, 12 | new int[] {10,3,6,5,11,7,12,5,4,11,8,9,11,3,9,5,12,6,8,11,12,3,4,6,11,10,5,6,7,12,8,4,9,12,3,6,12,8,9,3,6,10,3,7,5,3,9,10,3,4,11,10,3,8,5,7,8,12,6,11,7,8,12,}, 13 | new int[] {9,4,5,12,7,5,8,10,9,4,5,6,10,11,8,5,6,8,9,7,11,6,8,12,7,9,4,6,9,12,8,4,7,5,8,6,11,8,4,7,8,12,10,8,5,7,12,5,8,3,6,11,4,5,10,11,4,3,11,4,5,11,12,}, 14 | new int[] {3,10,8,3,10,11,5,12,6,9,7,5,3,9,6,7,5,12,8,5,4,7,5,11,6,4,12,10,6,4,11,10,3,7,6,10,7,12,11,9,6,12,5,7,4,3,12,8,3,5,7,9,4,5,3,4,10,6,3,9,7,12,5,}, 15 | new int[] {10,5,12,6,11,7,12,5,10,9,6,12,11,5,8,10,7,4,8,3,6,12,11,10,5,7,6,10,7,3,6,11,10,6,9,10,7,9,10,11,8,12,4,5,6,9,4,8,3,7,4,5,7,11,9,10,7,8,4,6,7,5,4,}, 16 | }, 17 | 18 | /* 91% */ 19 | new int[][] { 20 | new int[] {7,10,3,9,6,10,11,5,4,9,11,4,3,7,9,5,7,9,4,5,8,9,11,10,5,8,12,3,9,7,4,11,12,4,6,9,10,6,5,11,8,5,10,6,11,12,9,7,11,3,8,7,5,6,11,7,10,4,9,6,10,4,9,}, 21 | new int[] {3,6,8,4,10,6,12,10,8,11,12,5,11,8,4,10,12,9,7,4,5,7,9,3,7,5,10,11,7,10,11,6,4,8,12,4,3,6,8,11,5,9,6,10,9,5,8,7,3,10,8,9,11,5,7,4,8,6,7,11,4,5,7,}, 22 | new int[] {5,7,8,10,3,8,7,4,8,11,12,5,9,8,5,9,6,4,9,8,11,7,4,10,6,4,11,9,8,7,6,11,9,4,11,8,5,7,6,10,4,8,6,11,8,12,11,7,6,8,4,9,3,8,11,6,4,5,12,3,5,7,6,}, 23 | new int[] {9,4,5,8,3,12,7,4,11,9,7,6,8,10,4,12,7,9,11,4,3,9,7,3,4,12,11,9,8,3,12,10,3,9,10,6,11,4,3,9,11,12,10,11,8,4,10,7,12,4,5,7,3,11,6,7,8,9,10,11,4,10,3,}, 24 | new int[] {9,6,7,8,12,10,9,12,7,5,12,10,7,3,10,4,3,7,8,5,3,10,9,11,6,8,3,10,4,5,11,9,6,3,8,6,10,12,5,8,10,11,7,4,8,10,12,7,5,10,4,3,10,8,11,6,4,10,12,7,6,11,8,}, 25 | }, 26 | 27 | /* 92% */ 28 | new int[][] { 29 | new int[] {8,7,3,12,6,10,11,9,6,5,9,11,5,6,7,8,5,9,10,12,4,6,10,8,5,6,9,11,6,4,9,10,12,9,11,4,6,12,5,9,12,7,5,11,7,12,3,4,10,3,9,5,7,6,11,7,8,10,3,7,8,6,10,}, 30 | new int[] {3,11,4,12,7,4,10,5,9,8,3,9,4,7,5,4,10,11,8,12,6,8,4,12,8,10,9,8,10,4,5,6,10,12,5,11,3,10,5,8,7,10,5,7,12,6,11,9,7,8,9,6,4,9,7,6,8,10,7,6,5,9,4,}, 31 | new int[] {8,4,9,8,5,9,3,4,9,5,3,9,4,6,7,4,5,9,8,12,5,10,11,6,5,4,9,5,11,8,3,11,12,7,5,3,7,9,12,8,6,11,9,7,5,11,7,4,10,5,6,3,11,7,8,4,9,10,4,9,5,3,9,}, 32 | new int[] {11,9,7,5,8,3,5,6,11,5,10,6,4,7,9,5,4,10,7,5,4,3,11,4,12,8,4,7,8,3,5,10,11,5,7,9,5,3,9,4,6,5,11,4,3,6,11,9,7,12,10,7,11,9,3,4,8,12,5,6,7,3,10,}, 33 | new int[] {10,12,4,11,3,4,9,5,10,11,12,9,10,3,5,4,11,8,7,5,3,11,6,7,12,6,8,5,10,11,6,4,10,7,5,11,9,8,4,6,9,3,11,8,6,12,11,6,5,12,10,5,9,8,10,4,5,3,6,7,11,9,8,}, 34 | }, 35 | 36 | /* 93% */ 37 | new int[][] { 38 | new int[] {7,9,6,10,8,3,4,8,10,6,7,10,5,8,4,9,6,10,12,11,3,8,5,7,4,6,8,4,11,3,8,6,12,11,7,12,3,9,11,5,8,4,5,10,7,4,10,9,3,6,7,4,5,10,9,6,4,10,8,11,4,10,6,}, 39 | new int[] {5,7,10,9,6,11,12,6,9,3,7,4,11,6,4,7,6,3,5,7,8,11,5,9,4,6,9,5,8,7,6,5,9,10,7,5,8,10,11,5,6,4,7,11,5,12,10,9,7,6,11,5,10,6,11,9,12,8,5,7,3,8,4,}, 40 | new int[] {10,7,11,10,5,4,10,6,11,12,7,10,9,12,10,6,12,4,9,12,4,9,8,5,7,10,3,11,8,10,7,3,9,7,12,6,11,4,7,8,9,3,4,9,12,5,3,7,11,3,7,5,8,9,7,4,6,5,3,9,6,11,3,}, 41 | new int[] {8,9,7,5,4,7,6,11,12,4,10,12,9,6,7,5,3,10,4,12,5,9,8,10,9,5,10,12,5,6,10,12,4,8,5,4,11,9,7,12,11,6,9,3,8,11,4,6,7,11,6,3,5,4,10,6,5,4,10,7,6,9,10,}, 42 | new int[] {10,12,6,5,4,11,3,12,7,4,6,9,8,4,11,6,9,7,3,6,9,3,10,7,6,4,11,5,9,7,6,11,10,5,8,4,12,3,10,8,6,12,7,10,4,6,10,9,7,12,8,4,7,11,3,6,9,4,3,12,11,6,8,}, 43 | }, 44 | 45 | /* 94% */ 46 | new int[][] { 47 | new int[] {10,4,9,6,11,12,9,10,5,8,6,7,12,3,5,11,12,4,7,9,6,3,7,6,11,8,12,10,8,7,5,11,12,9,7,4,5,10,8,9,4,3,6,8,3,7,5,4,9,6,8,5,4,11,5,4,11,7,6,5,11,9,12,}, 48 | new int[] {8,4,12,7,6,8,9,6,5,4,10,5,8,4,10,6,7,4,10,5,3,6,11,10,6,4,12,8,5,10,9,12,5,7,6,8,12,6,11,12,7,5,12,10,5,11,9,12,3,11,10,7,3,9,11,7,4,8,11,9,4,12,10,}, 49 | new int[] {12,4,3,6,12,9,4,7,11,10,8,3,11,9,4,7,8,6,3,9,10,6,9,7,10,3,9,6,10,11,9,5,3,6,8,7,3,10,11,9,10,6,5,4,11,8,5,9,8,4,11,5,9,12,4,6,5,4,8,6,12,5,3,}, 50 | new int[] {5,7,9,3,7,9,4,3,6,5,4,12,10,11,3,5,7,6,10,4,5,6,7,11,3,12,6,8,11,7,5,3,12,5,6,3,11,12,3,9,12,4,11,8,5,3,9,8,10,3,11,8,5,9,7,8,9,11,10,4,7,3,10,}, 51 | new int[] {7,8,5,9,6,7,10,12,9,3,7,8,6,11,8,7,4,9,6,7,10,11,12,7,9,6,4,8,3,10,6,4,7,3,9,6,11,5,3,6,10,12,5,11,3,12,8,7,5,6,7,8,12,7,5,12,7,5,9,3,8,9,10,}, 52 | }, 53 | 54 | /* 95% */ 55 | new int[][] { 56 | new int[] {10,5,9,12,3,8,4,7,8,3,12,9,6,4,10,7,9,3,8,4,5,9,12,4,5,11,12,6,3,5,8,3,10,7,9,4,8,5,11,8,4,12,8,5,6,7,3,11,10,6,4,10,12,5,4,8,10,7,11,10,6,3,8,}, 57 | new int[] {5,6,10,3,5,10,11,5,9,6,3,12,7,11,10,6,7,4,12,10,9,6,11,9,5,8,4,6,5,7,11,4,10,11,9,3,4,10,11,9,8,5,12,8,4,10,11,9,12,6,9,12,7,6,9,5,8,4,5,11,9,6,8,}, 58 | new int[] {7,4,6,5,10,8,6,10,5,4,7,9,10,7,12,11,5,6,7,5,4,10,6,3,12,4,9,5,11,6,9,8,12,4,7,3,10,11,7,12,10,4,11,5,3,9,8,10,9,12,11,6,10,9,11,4,7,6,8,5,4,6,11,}, 59 | new int[] {9,12,3,6,10,3,4,5,7,4,5,8,9,10,12,5,4,8,5,11,12,10,3,11,6,5,12,3,6,8,4,10,8,7,6,12,8,5,3,6,10,9,5,7,9,5,8,10,3,12,5,11,3,5,4,10,3,4,8,3,6,7,4,}, 60 | new int[] {12,8,9,7,8,6,5,11,3,5,7,9,6,3,11,4,12,7,3,5,8,11,4,5,11,7,9,3,10,5,3,7,8,4,9,6,7,8,4,10,3,12,10,7,5,12,6,9,10,5,7,9,12,10,5,6,12,11,8,3,10,4,3,}, 61 | }, 62 | 63 | /* 96% */ 64 | new int[][] { 65 | new int[] {3,4,10,7,11,9,6,7,4,8,9,10,3,7,12,6,7,5,6,4,11,7,10,11,6,7,10,3,11,6,10,8,4,12,3,5,8,4,9,11,6,10,5,8,12,7,4,10,7,5,12,4,6,12,11,5,9,8,12,5,8,9,7,}, 66 | new int[] {9,3,5,6,8,4,5,6,11,7,9,11,10,9,5,6,12,3,6,9,5,8,6,9,3,7,11,10,7,4,6,12,9,11,4,3,7,12,3,5,9,10,7,11,8,12,7,5,3,7,10,12,9,11,4,7,3,4,5,9,4,12,11,}, 67 | new int[] {5,11,4,9,7,12,4,8,10,6,8,9,5,3,10,4,3,6,12,4,8,10,6,12,8,6,12,10,7,11,4,8,11,12,10,11,4,9,8,5,3,7,5,8,12,10,6,5,11,12,9,4,6,5,12,4,8,5,9,7,10,4,3,}, 68 | new int[] {12,6,5,7,11,8,6,5,11,9,6,7,8,12,3,11,5,10,8,5,11,4,5,10,11,5,12,8,10,11,8,6,4,9,3,6,8,11,6,12,5,4,8,10,5,6,9,10,3,11,7,5,8,7,5,8,12,3,4,9,10,8,3,}, 69 | new int[] {9,3,8,11,7,8,11,4,5,3,11,12,6,5,9,7,5,9,10,3,4,7,3,8,11,9,7,5,12,6,8,12,3,4,6,5,7,4,5,12,11,5,3,7,9,6,11,9,7,10,6,11,5,8,9,10,8,12,11,10,7,5,10,}, 70 | }, 71 | 72 | /* 97% */ 73 | new int[][] { 74 | new int[] {10,4,6,10,9,8,3,10,11,4,10,6,8,10,3,7,11,3,4,7,6,5,3,12,6,5,12,3,8,4,7,8,4,11,6,4,8,7,5,12,9,3,12,9,7,5,9,11,3,6,10,5,6,12,8,3,12,8,5,7,6,8,7,}, 75 | new int[] {11,6,7,5,8,3,12,11,8,4,5,8,4,9,11,6,8,7,4,6,11,12,6,10,5,7,12,9,7,12,8,6,4,12,11,8,5,7,10,12,6,10,9,12,3,6,4,9,6,4,5,9,4,7,9,5,11,3,12,7,5,6,8,}, 76 | new int[] {7,10,5,8,11,5,4,7,10,5,3,9,7,11,5,6,4,11,10,8,4,12,11,5,9,10,7,6,9,8,6,10,11,5,8,3,5,9,11,10,6,4,10,5,7,9,11,4,5,8,3,6,4,9,3,7,11,5,8,12,5,9,11,}, 77 | new int[] {4,5,11,8,6,3,7,8,6,4,7,6,11,7,5,4,11,7,10,11,8,6,9,3,12,6,4,7,5,6,10,12,9,10,5,7,4,8,11,10,4,9,12,10,9,3,11,12,4,7,8,9,7,8,12,4,8,3,9,6,5,8,10,}, 78 | new int[] {11,4,12,11,5,8,4,11,9,3,6,10,3,7,4,6,5,7,10,8,5,11,7,9,4,8,11,9,12,6,9,12,7,8,9,7,4,11,8,10,7,4,5,9,7,8,10,3,5,11,12,6,10,4,9,11,7,5,4,11,8,6,10,}, 79 | }, 80 | 81 | /* 98% */ 82 | new int[][] { 83 | new int[] {5,7,11,10,6,7,12,6,7,9,10,5,6,7,8,3,7,6,4,7,5,6,9,5,12,11,8,6,10,4,11,10,6,8,10,5,4,8,6,10,11,4,7,9,5,12,3,8,4,10,7,5,11,8,6,4,12,11,7,3,12,4,9,}, 84 | new int[] {11,6,9,7,4,9,12,6,3,9,11,10,12,4,7,10,12,9,10,5,4,7,10,4,5,6,4,3,9,8,7,5,9,7,8,5,11,6,4,8,6,3,7,6,4,9,6,8,5,7,10,4,7,3,10,11,9,12,5,6,4,10,8,}, 85 | new int[] {8,10,7,9,4,12,3,11,5,10,7,12,11,9,3,11,10,7,11,8,6,3,5,11,7,4,11,8,9,5,11,4,12,10,5,12,6,3,7,10,4,5,7,6,11,5,4,7,3,6,7,4,9,12,7,8,11,4,7,9,10,5,7,}, 86 | new int[] {12,7,3,6,7,10,12,3,5,11,4,6,12,8,6,3,11,8,5,11,7,5,4,6,8,4,3,10,4,5,11,10,6,7,5,4,9,7,5,3,11,8,10,3,9,5,10,7,9,10,5,6,3,10,7,5,9,11,7,10,9,11,6,}, 87 | new int[] {3,12,7,3,6,12,7,4,12,3,7,8,11,3,4,7,9,5,11,7,8,4,10,3,8,11,3,7,8,5,7,10,3,11,12,9,7,4,9,11,10,7,5,8,4,11,9,3,8,5,6,11,12,8,3,10,6,3,10,11,3,8,7,}, 88 | }, 89 | 90 | /* 99% */ 91 | new int[][] { 92 | new int[] {11,6,7,11,5,10,9,8,4,10,6,3,7,9,6,5,4,11,12,10,6,5,7,11,12,5,4,7,10,11,7,9,11,7,6,10,8,5,9,4,12,6,11,8,10,7,3,9,10,7,4,6,10,8,4,6,3,4,8,3,6,4,7,}, 93 | new int[] {11,3,8,4,5,3,10,6,4,5,11,7,10,3,6,8,4,10,7,12,5,10,11,9,8,4,5,7,11,3,4,7,10,12,6,4,10,6,7,10,12,5,3,11,8,5,3,7,6,4,11,9,8,11,4,5,6,10,7,11,10,8,6,}, 94 | new int[] {10,4,12,3,10,9,7,5,10,7,8,10,4,9,6,5,10,6,8,5,12,10,5,6,10,4,7,8,11,5,9,3,5,8,12,7,6,11,3,6,12,10,7,3,9,6,4,12,11,9,5,7,9,6,12,7,5,9,11,7,4,8,7,}, 95 | new int[] {6,9,11,10,8,9,6,5,11,8,5,7,12,9,11,7,10,11,7,6,9,4,3,8,5,4,11,7,4,9,11,6,9,12,4,6,3,8,6,12,10,9,11,5,10,4,7,11,3,4,8,11,4,5,11,12,8,3,9,7,8,5,7,}, 96 | new int[] {5,9,10,11,4,5,8,4,10,5,6,11,10,6,8,3,6,7,11,6,9,10,12,4,10,12,4,8,9,4,6,9,12,4,5,11,3,8,7,4,10,5,6,8,4,3,11,5,8,9,10,5,8,3,6,11,8,7,12,4,5,10,8,}, 97 | }, 98 | }; 99 | 100 | for(int i=0; i 5) { 337 | b = j; 338 | } 339 | } 340 | if (a == -1 || b == -1) { 341 | done = true; 342 | break; 343 | } 344 | 345 | int x = -1; 346 | for (int i = 0; i < 9; i++) { 347 | if (bingoCards [i] [a] == 0 && bingoCards [i] [b] != 0) { 348 | x = i; 349 | break; 350 | } 351 | } 352 | 353 | if (x == -1) { 354 | done = false; 355 | continue; 356 | } 357 | 358 | int swap = bingoCards [x] [a]; 359 | bingoCards [x] [a] = bingoCards [x] [b]; 360 | bingoCards [x] [b] = swap; 361 | numbersInRow [a]++; 362 | numbersInRow [b]--; 363 | wasItChanged = true; 364 | } while (done == false); 365 | 366 | return (wasItChanged); 367 | } 368 | 369 | /** 370 | * Shuffle the numbers in single bingo card. 371 | */ 372 | private void shuffleBingoCards () { 373 | for (int i = 0; i < BINGO_CARDS_WIDTH; i++) { 374 | for (int last = BINGO_CARDS_LENGTH - 1, r = -1, swap = -1; last > 0; 375 | last--) { 376 | r = Util.prng.Next (last + 1); 377 | swap = bingoCards [i] [last]; 378 | bingoCards [i] [last] = bingoCards [i] [r]; 379 | bingoCards [i] [r] = swap; 380 | } 381 | } 382 | 383 | for (int j = 0; j < BINGO_CARDS_LENGTH; j++) { 384 | numbersInRow [j] = 0; 385 | } 386 | 387 | for (int j = 0; j < BINGO_CARDS_LENGTH; j++) { 388 | for (int i = 0; i < BINGO_CARDS_WIDTH; i++) { 389 | numbersInRow [j] += (bingoCards [i] [j] != 0 ? 1 : 0); 390 | } 391 | } 392 | } 393 | 394 | /** 395 | * Generate random bingo card with 6 talons in it. Also mark the card as empty. 396 | */ 397 | private void generateRandomBingoCard () { 398 | int shakes = 0; 399 | bool goOn = false; 400 | do { 401 | if (shakes <= 0) { 402 | shuffleBingoCards (); 403 | shakes = NUMBER_OF_SHAKES; 404 | } 405 | 406 | goOn = fixRows (); 407 | goOn = fixThreeRows () || goOn; 408 | shakes--; 409 | } while (goOn == true); 410 | 411 | for (int j = 0; j < BINGO_CARDS_LENGTH; j++) { 412 | for (int i = 0; i < BINGO_CARDS_WIDTH; i++) { 413 | bingoNumbersOut [i] [j] = false; 414 | } 415 | } 416 | 417 | bingoLineIndex = -1; 418 | bingoCardIndex = -1; 419 | } 420 | 421 | /** 422 | * Single reels spin to fill view with symbols. 423 | * 424 | * @param reels Reels strips. 425 | * 426 | * @author Todor Balabanov 427 | * 428 | * @email tdb@tbsoft.eu 429 | * 430 | * @date 10 Mar 2013 431 | */ 432 | private void spin (int[][] reels, int[] positions){ 433 | for (int i = 0; i < view.Length && i < reels.Length; i++) { 434 | int r = positions[i]; 435 | int u = r - 1; 436 | int d = r + 1; 437 | 438 | if (u < 0) { 439 | u = reels [i].Length - 1; 440 | } 441 | 442 | if (d >= reels [i].Length) { 443 | d = 0; 444 | } 445 | 446 | view [i] [0] = reels [i] [u]; 447 | view [i] [1] = reels [i] [r]; 448 | view [i] [2] = reels [i] [d]; 449 | } 450 | } 451 | 452 | /** 453 | * Single reels spin to fill view with symbols. 454 | * 455 | * @param reels Reels strips. 456 | * 457 | * @author Todor Balabanov 458 | * 459 | * @email tdb@tbsoft.eu 460 | * 461 | * @date 10 Mar 2013 462 | */ 463 | private void spin (int[][] reels) { 464 | for (int i = 0; i < view.Length && i < reels.Length; i++) { 465 | int r = Util.prng.Next (reels [i].Length); 466 | int u = r - 1; 467 | int d = r + 1; 468 | 469 | if (u < 0) { 470 | u = reels [i].Length - 1; 471 | } 472 | 473 | if (d >= reels [i].Length) { 474 | d = 0; 475 | } 476 | 477 | view [i] [0] = reels [i] [u]; 478 | view [i] [1] = reels [i] [r]; 479 | view [i] [2] = reels [i] [d]; 480 | } 481 | } 482 | 483 | /** 484 | * Calculate win in particular line. 485 | * 486 | * @param line Single line. 487 | * 488 | * @return Calculated win. 489 | * 490 | * @author Todor Balabanov 491 | * 492 | * @email tdb@tbsoft.eu 493 | * 494 | * @date 10 Mar 2013 495 | */ 496 | private int lineWin (int[] line) { 497 | /* 498 | * Keep first symbol in the line. 499 | */ 500 | int symbol = line [0]; 501 | 502 | /* 503 | * Count symbols in winning line. 504 | */ 505 | int number = 0; 506 | for (int i = 0; i < line.Length; i++) { 507 | if (line [i] == symbol) { 508 | number++; 509 | } else { 510 | break; 511 | } 512 | } 513 | 514 | /* 515 | * Cleare unused symbols. 516 | */ 517 | for (int i = number; i < line.Length; i++) { 518 | line [i] = -1; 519 | } 520 | 521 | int win = Paytable.values [number] [symbol]; 522 | 523 | if (win > 0) { 524 | baseSymbolMoney [number] [symbol] += win; 525 | baseGameSymbolsHitRate [number] [symbol]++; 526 | } 527 | 528 | return(win); 529 | } 530 | 531 | /** 532 | * Calculate win in all possible lines. 533 | * 534 | * @param view Symbols visible in screen view. 535 | * 536 | * @return Calculated win. 537 | * 538 | * @author Todor Balabanov 539 | * 540 | * @email tdb@tbsoft.eu 541 | * 542 | * @date 10 Mar 2013 543 | */ 544 | private int linesWin (int[][] view) { 545 | int win = 0; 546 | 547 | /* 548 | * Check wins in all possible lines. 549 | */ 550 | for (int l = 0; l < lines.Length; l++) { 551 | int[] line = { -1, -1, -1, -1, -1 }; 552 | 553 | /* 554 | * Prepare line for combination check. 555 | */ 556 | for (int i = 0; i < line.Length; i++) { 557 | int index = lines [l] [i]; 558 | line [i] = view [i] [index]; 559 | } 560 | 561 | int result = lineWin (line); 562 | 563 | /* 564 | * Accumulate line win. 565 | */ 566 | win += result; 567 | } 568 | 569 | return(win); 570 | } 571 | 572 | /** 573 | * Mark bingo number and return it to the caller. 574 | * 575 | * @return The number marked. 576 | * 577 | * @author Todor Balabanov 578 | * 579 | * @email tdb@tbsoft.eu 580 | * 581 | * @date 27 Feb 2015 582 | */ 583 | private int ballOut () { 584 | bool canBeFound = false; 585 | 586 | /* 587 | * Check for available numbers. 588 | */ 589 | for (int b = 0; b < BINGO_CARDS_LENGTH; b++) { 590 | for (int a = 0; a < BINGO_CARDS_WIDTH; a++) { 591 | if (bingoNumbersOut [a] [b] == false && bingoCards [a] [b] != 0) { 592 | canBeFound = true; 593 | } 594 | } 595 | } 596 | 597 | /* 598 | * It should not be possible to search for numbers when there is no any. 599 | */ 600 | if (canBeFound == false) { 601 | return (-1); 602 | } 603 | 604 | int i = -1; 605 | int j = -1; 606 | do { 607 | i = Util.prng.Next (BINGO_CARDS_WIDTH); 608 | j = Util.prng.Next (BINGO_CARDS_LENGTH); 609 | } while (bingoNumbersOut [i] [j] == true || bingoCards [i] [j] == 0); 610 | 611 | bingoNumbersOut [i] [j] = true; 612 | 613 | return (bingoCards [i] [j]); 614 | } 615 | 616 | /** 617 | * Check is there a bingo line combination. 618 | * 619 | * @return True if there is a bingo line, false otherwise. 620 | * 621 | * @author Todor Balabanov 622 | * 623 | * @email tdb@tbsoft.eu 624 | * 625 | * @date 27 Feb 2015 626 | */ 627 | private bool bingoLine () { 628 | if (bingoLineIndex != -1) { 629 | return (false); 630 | } 631 | 632 | for (int j = 0; j < BINGO_CARDS_LENGTH; j++) { 633 | int count = 0; 634 | for (int i = 0; i < BINGO_CARDS_WIDTH; i++) { 635 | if (bingoNumbersOut [i] [j] == true && bingoCards [i] [j] != 0) { 636 | count++; 637 | } 638 | } 639 | 640 | if (count > 5) { 641 | //TODO It should not be possible. 642 | } else if (count == 5) { 643 | bingoLineIndex = j; 644 | return (true); 645 | } 646 | } 647 | 648 | return (false); 649 | } 650 | 651 | /** 652 | * Bingo line bonus win. 653 | * 654 | * @return Amount of the win according discrete distribution. 655 | * 656 | * @author Todor Balabanov 657 | * 658 | * @email tdb@tbsoft.eu 659 | * 660 | * @date 27 Feb 2015 661 | */ 662 | private int bingoLineWin () { 663 | return (bingoLineBonusDistribution [Util.prng.Next (BINGO_BONUS_DISTRIBUTION_LENGTH)]); 664 | } 665 | 666 | /** 667 | * Check is there a bingo combination. 668 | * 669 | * @return True if there is a bingo, false otherwise. 670 | * 671 | * @author Todor Balabanov 672 | * 673 | * @email tdb@tbsoft.eu 674 | * 675 | * @date 27 Feb 2015 676 | */ 677 | private bool bingo () { 678 | if (bingoCardIndex != -1) { 679 | return (false); 680 | } 681 | 682 | int count = 0; 683 | for (int j = 0; j < BINGO_CARDS_LENGTH; j++) { 684 | if (j % 3 == 0) { 685 | count = 0; 686 | } 687 | 688 | for (int i = 0; i < BINGO_CARDS_WIDTH; i++) { 689 | if (bingoNumbersOut [i] [j] == true && bingoCards [i] [j] != 0) { 690 | count++; 691 | } 692 | } 693 | 694 | if (count > 15) { 695 | //TODO It should not be possible. 696 | } else if (count == 15) { 697 | bingoCardIndex = j / 3; 698 | return (true); 699 | } 700 | } 701 | 702 | return (false); 703 | } 704 | 705 | /** 706 | * Bingo bonus win. 707 | * 708 | * @return Amount of the win according discrete distribution. 709 | * 710 | * @author Todor Balabanov 711 | * 712 | * @email tdb@tbsoft.eu 713 | * 714 | * @date 27 Feb 2015 715 | */ 716 | private int bingoWin () { 717 | return (bingoBonusDistribution [Util.prng.Next (BINGO_BONUS_DISTRIBUTION_LENGTH)]); 718 | } 719 | 720 | /** 721 | * Simulation constructor. 722 | * 723 | * @author Todor Balabanov 724 | * 725 | * @email tdb@tbsoft.eu 726 | * 727 | * @date 27 Feb 2015 728 | */ 729 | public SlotMachineSimulation () { 730 | totalBet = lines.Length; 731 | } 732 | 733 | public long getWonMoney () { 734 | return wonMoney; 735 | } 736 | 737 | public long getLostMoney () { 738 | return lostMoney; 739 | } 740 | 741 | public void load (int[][]reels) { 742 | this.reels = reels; 743 | // for (int i = 0; i < reels.Length; i++) { 744 | // for (int j = 0; j < reels [i].Length; j++) { 745 | // this.reels [i] [j] = reels [i] [j]; 746 | // } 747 | // } 748 | } 749 | 750 | /** 751 | * Simulation variables reset. 752 | * 753 | * @author Todor Balabanov 754 | * 755 | * @email tdb@tbsoft.eu 756 | * 757 | * @date 27 Feb 2015 758 | */ 759 | public void reset () { 760 | } 761 | 762 | /** 763 | * Play single base game. 764 | * 765 | * @author Todor Balabanov 766 | * 767 | * @email tdb@tbsoft.eu 768 | * 769 | * @date 10 Mar 2013 770 | */ 771 | private void singleBaseGame () { 772 | /* 773 | * Spin reels. 774 | */ 775 | spin (reels); 776 | 777 | /* 778 | * Win accumulated by lines. 779 | */ 780 | int win = linesWin (view); 781 | int win1 = win; 782 | 783 | /* 784 | * Add win to the statistics. 785 | */ 786 | baseMoney += win; 787 | wonMoney += win; 788 | if (baseMaxWin < win) { 789 | baseMaxWin = win; 790 | } 791 | 792 | /* 793 | * Count base game hit rate. 794 | */ 795 | if (win > 0) { 796 | baseGameHitRate++; 797 | } 798 | 799 | /* 800 | * Run bonus game. 801 | */ 802 | ballOut (); 803 | win = 0; 804 | 805 | /* 806 | * Check for bingo line bonus. 807 | */ 808 | if (bingoLine () == true) { 809 | win = bingoLineWin (); 810 | bonusGameHitRate++; 811 | } 812 | int win2 = win; 813 | 814 | /* 815 | * Add win to the statistics. 816 | */ 817 | bonusMoney += win; 818 | wonMoney += win; 819 | 820 | /* 821 | * Check for bingo bonus. 822 | */ 823 | if (bingo () == true) { 824 | win = bingoWin (); 825 | bonusGameHitRate++; 826 | } 827 | int win3 = win; 828 | 829 | /* 830 | * Add win to the statistics. 831 | */ 832 | bonusMoney += win; 833 | wonMoney += win; 834 | 835 | if((win1+win2+win3) > 0) { 836 | wins.Add(win1+win2+win3); 837 | } 838 | } 839 | 840 | public void runBaseGame () { 841 | if (bingoLineIndex != -1 && bingoCardIndex != -1) { 842 | generateRandomBingoCard (); 843 | } 844 | 845 | lostMoney += totalBet; 846 | singleBaseGame (); 847 | totalNumberOfGames++; 848 | } 849 | 850 | public void enforceSymbolsDiversity (int length) { 851 | int matches = 0; 852 | 853 | for (int i = 0; i < reels.Length; i++) { 854 | for (int j = 0; j < reels [i].Length; j++) { 855 | for (int k = 0; k < length - 1; k++) { 856 | for (int l = k + 1; l < length; l++) { 857 | if ((reels [i] [(j + k) % reels [i].Length]) == (reels [i] [(j + l) % reels [i].Length])) { 858 | reels [i] [(j + l) % reels [i].Length] = Symbols.randomValid (); 859 | matches++; 860 | } 861 | } 862 | } 863 | } 864 | } 865 | 866 | if (matches > 0) { 867 | enforceSymbolsDiversity (length); 868 | } 869 | } 870 | 871 | public int maxWin (){ 872 | int max = 0; 873 | int win = 0; 874 | int[] positions = new int[reels.Length]; 875 | 876 | for (int i=0; i max) { 885 | max = win; 886 | } 887 | 888 | positions [0]++; 889 | for (int i=0; i= reels [i].Length) { 891 | positions [i] = 0; 892 | positions [i + 1]++; 893 | } 894 | } 895 | 896 | done = true; 897 | for (int i=0; i 0) { 918 | average += baseSymbolMoney [i] [j] / (double)totalNumberOfGames; 919 | k++; 920 | } 921 | } 922 | } 923 | if (k > 0) { 924 | average /= k; 925 | } 926 | 927 | k = 0; 928 | double result = 0; 929 | for (int i = 0; i < baseSymbolMoney.Length; i++) { 930 | for (int j = 0; j < baseSymbolMoney [i].Length; j++) { 931 | if (baseSymbolMoney [i] [j] > 0) { 932 | result += (baseSymbolMoney [i] [j] / (double)totalNumberOfGames - average) * (baseSymbolMoney [i] [j] / (double)totalNumberOfGames - average); 933 | k++; 934 | } 935 | } 936 | } 937 | if (k > 0) { 938 | result /= k; 939 | } 940 | 941 | return result; 942 | } 943 | 944 | public double symbolsDiversity (int length) { 945 | int count = 0; 946 | int matches = 0; 947 | 948 | for (int i = 0; i < reels.Length; i++) { 949 | for (int j = 0; j < reels [i].Length; j++) { 950 | for (int k = 0; k < length - 1; k++) { 951 | for (int l = k + 1; l < length; l++) { 952 | if ((reels [i] [(j + k) % reels [i].Length]) == (reels [i] [(j + l) % reels [i].Length])) { 953 | matches++; 954 | } 955 | count++; 956 | } 957 | } 958 | } 959 | } 960 | 961 | return (double)matches / (double)count; 962 | } 963 | 964 | public double costFunction (double target, int length) { 965 | return symbolsDiversity (length) * 1 + rtpDifference (target) * 100 + prizeDeviation () * 10; 966 | } 967 | 968 | public void simulate (int length) { 969 | if (Util.STRICT_SYMBOLS_DIVERSITY == true) { 970 | enforceSymbolsDiversity (length); 971 | } 972 | 973 | for (int r = 0; r < NUMBER_OF_EXPERIMENTS; r++) { 974 | for (long e = 0; e < NUMBER_OF_SIMUALTIONS; e++) { 975 | runBaseGame (); 976 | } 977 | } 978 | } 979 | 980 | /** 981 | * Print all simulation input data structures. 982 | * 983 | * @author Todor Balabanov 984 | * 985 | * @email tdb@tbsoft.eu 986 | * 987 | * @date 10 Mar 2013 988 | */ 989 | public String printDataStructures () { 990 | String result = ""; 991 | 992 | result += "Paytable:"; 993 | result += "\r\n"; 994 | for (int i = 0; i < Paytable.values.Length; i++) { 995 | result += "\t" + i + " of"; 996 | } 997 | result += "\r\n"; 998 | for (int j = 0; j < Paytable.values [0].Length; j++) { 999 | result += "SYM" + j + "\t"; 1000 | for (int i = 0; i < Paytable.values.Length; i++) { 1001 | result += Paytable.values [i] [j] + "\t"; 1002 | } 1003 | result += "\r\n"; 1004 | } 1005 | result += "\r\n"; 1006 | 1007 | result += "Lines:"; 1008 | result += "\r\n"; 1009 | for (int i = 0; i < lines.Length; i++) { 1010 | for (int j = 0; j < lines [0].Length; j++) { 1011 | result += lines [i] [j] + " "; 1012 | } 1013 | result += "\r\n"; 1014 | } 1015 | result += "\r\n"; 1016 | 1017 | result += "Base Game Reels:"; 1018 | result += "\r\n"; 1019 | for (int i = 0; i < reels.Length; i++) { 1020 | for (int j = 0; j < reels [i].Length; j++) { 1021 | if (j % 10 == 0) { 1022 | result += "\r\n"; 1023 | } 1024 | result += "SYM" + reels [i] [j] + " "; 1025 | } 1026 | result += "\r\n"; 1027 | } 1028 | result += "\r\n"; 1029 | 1030 | result += "Base Game Reels:"; 1031 | result += "\r\n"; 1032 | /* Count symbols in reels. */ 1033 | { 1034 | int[][] counters = { 1035 | new int[]{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 1036 | new int[]{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 1037 | new int[]{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 1038 | new int[]{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 1039 | new int[]{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 } 1040 | }; 1041 | for (int i = 0; i < reels.Length; i++) { 1042 | for (int j = 0; j < reels [i].Length; j++) { 1043 | counters [i] [reels [i] [j]]++; 1044 | } 1045 | } 1046 | for (int i = 0; i < reels.Length; i++) { 1047 | result += "\tReel " + (i + 1); 1048 | } 1049 | result += "\r\n"; 1050 | for (int j = 0; j < counters [0].Length; j++) { 1051 | result += "SYM" + j + "\t"; 1052 | for (int i = 0; i < counters.Length; i++) { 1053 | result += counters [i] [j] + "\t"; 1054 | } 1055 | result += "\r\n"; 1056 | } 1057 | result += "---------------------------------------------"; 1058 | result += "\r\n"; 1059 | result += "Total:\t"; 1060 | long combinations = 1L; 1061 | for (int i = 0; i < counters.Length; i++) { 1062 | int sum = 0; 1063 | for (int j = 0; j < counters [0].Length; j++) { 1064 | sum += counters [i] [j]; 1065 | } 1066 | result += sum + "\t"; 1067 | if (sum != 0) { 1068 | combinations *= sum; 1069 | } 1070 | } 1071 | result += "\r\n"; 1072 | result += "---------------------------------------------"; 1073 | result += "\r\n"; 1074 | result += "Combinations:\t" + combinations; 1075 | result += "\r\n"; 1076 | } 1077 | result += "\r\n"; 1078 | 1079 | //TODO Print bing bonus data structures. 1080 | 1081 | return result; 1082 | } 1083 | 1084 | /** 1085 | * Print simulation statistics. 1086 | * 1087 | * @author Todor Balabanov 1088 | * 1089 | * @email tdb@tbsoft.eu 1090 | * 1091 | * @date 10 Mar 2013 1092 | */ 1093 | public String printStatistics () { 1094 | String result = ""; 1095 | 1096 | result += ("Won money:\t" + wonMoney); 1097 | result += "\r\n"; 1098 | result += ("Lost money:\t" + lostMoney); 1099 | result += "\r\n"; 1100 | result += ("Total Number of Games:\t" + totalNumberOfGames); 1101 | result += "\r\n"; 1102 | result += "\r\n"; 1103 | result += ("Total RTP:\t" + ((double)wonMoney / (double)lostMoney) + "\t\t" + (100.0D * (double)wonMoney / (double)lostMoney) + "%"); 1104 | result += "\r\n"; 1105 | result += ("Base Game RTP:\t" + ((double)baseMoney / (double)lostMoney) + "\t\t" + (100.0D * (double)baseMoney / (double)lostMoney) + "%"); 1106 | result += "\r\n"; 1107 | result += ("Bonus Game RTP:\t" + ((double)bonusMoney / (double)lostMoney) + "\t\t" + (100.0D * (double)bonusMoney / (double)lostMoney) + "%"); 1108 | result += "\r\n"; 1109 | result += "\r\n"; 1110 | result += ("Hit Frequency in Base Game:\t" + ((double)baseGameHitRate / (double)totalNumberOfGames) + "\t\t" + (100.0D * (double)baseGameHitRate / (double)totalNumberOfGames) + "%"); 1111 | result += "\r\n"; 1112 | result += ("Hit Frequency in Bonus Game:\t" + ((double)bonusGameHitRate / (double)totalNumberOfGames) + "\t\t" + (100.0D * (double)bonusGameHitRate / (double)totalNumberOfGames) + "%"); 1113 | result += "\r\n"; 1114 | result += "\r\n"; 1115 | result += ("Max Win in Base Game:\t" + baseMaxWin); 1116 | result += "\r\n"; 1117 | // result += ("Max Possible Win in Base Game:\t" + maxWin()); 1118 | // result += "\r\n"; 1119 | 1120 | double mean = 0; 1121 | 1122 | foreach(int value in wins) { 1123 | mean += (double)value / (double) totalNumberOfGames; 1124 | } 1125 | result += ("Mean Win:\t" + mean); 1126 | result += "\r\n"; 1127 | 1128 | double sd = 0; 1129 | foreach(int value in wins) { 1130 | sd += ((double)value-mean)*((double)value-mean) / (double) totalNumberOfGames; 1131 | } 1132 | for(int i=wins.Count; i= 0) { 1195 | result += (" "); 1196 | } 1197 | result += (view [i] [j] + " "); 1198 | } 1199 | 1200 | result += "\r\n"; 1201 | } 1202 | 1203 | return result; 1204 | } 1205 | 1206 | public override string ToString () { 1207 | return printDataStructures () + printStatistics (); 1208 | } 1209 | } 1210 | } 1211 | 1212 | -------------------------------------------------------------------------------- /Symbols.cs: -------------------------------------------------------------------------------- 1 | using System; 2 | 3 | namespace BingoSlotDifferentialEvolutionOptimization { 4 | class Symbols { 5 | /** 6 | * List of symbols names. 7 | */ 8 | public static String[] names = { 9 | "", 10 | "", 11 | "", 12 | "SYM03", 13 | "SYM04", 14 | "SYM05", 15 | "SYM06", 16 | "SYM07", 17 | "SYM08", 18 | "SYM09", 19 | "SYM10", 20 | "SYM11", 21 | "SYM12", 22 | "", 23 | "", 24 | "", 25 | "", 26 | }; 27 | 28 | public static bool isValid(int symbol) { 29 | if (symbol < 0 || symbol >= names.Length) { 30 | return false; 31 | } 32 | 33 | if(names[symbol].Equals("") == true) { 34 | return false; 35 | } 36 | 37 | return true; 38 | } 39 | 40 | public static int randomValid() { 41 | int symbol = -1; 42 | 43 | do { 44 | symbol = Util.prng.Next(names.Length); 45 | } while(names[symbol].Equals("") == true); 46 | 47 | return symbol; 48 | } 49 | } 50 | } 51 | -------------------------------------------------------------------------------- /Util.cs: -------------------------------------------------------------------------------- 1 |  2 | using System; 3 | 4 | namespace BingoSlotDifferentialEvolutionOptimization { 5 | class Util { 6 | /** 7 | * Select random initial solutions. 8 | */ 9 | public const bool RANDOM_INITIAL_REELS = true; 10 | 11 | /** 12 | * Enforce symbols diversity. 13 | */ 14 | public const bool STRICT_SYMBOLS_DIVERSITY = true; 15 | 16 | /** 17 | * Report in steps. 18 | */ 19 | public const bool REEVALUATE_TARGET_VECTOR = true; 20 | 21 | /** 22 | * Report in steps. 23 | */ 24 | public const bool VERBOSE = false; 25 | 26 | /** 27 | * Pseudo-random number generator. 28 | */ 29 | public static Random prng = new Random (); 30 | } 31 | } 32 | 33 | -------------------------------------------------------------------------------- /format.sh: -------------------------------------------------------------------------------- 1 | #!/bin/bash 2 | astyle *.cs --indent=force-tab --style=java / -A2 3 | rm *.orig 4 | --------------------------------------------------------------------------------