| 267 | [=#GPBooleanEvenParity4] |
| 268 | === Genetic Programming - Even Parity (4 inputs) === |
| 269 | [attachment:SGP_Boolean-Even-Parity-4.hl] |
| 270 | A genetic programming algorithm to synthesize the boolean even parity function with 4 binary inputs |
| 271 | |
| 272 | * Population size: 4000 |
| 273 | * Generations: 100 |
| 274 | * Function set: AND, OR, NOT |
| 275 | * Terminal set: D0, D1, D2, D3 |
| 276 | * Max. function defining branches: 3 |
| 277 | * Max. function arguments: 3 |
| 278 | |
| 279 | Up to three automatically defined functions (ADF), each with up to three arguments, are allowed. |
| 280 | |
| 281 | ==== References ==== |
| 282 | John R. Koza, Genetic Programming - On the Programming of Computers by Means of Natural Selection, MIT Press, 1992 |
| 283 | |
| 284 | ---- |
| 285 | |
| 286 | [=#GPBooleanMultiplexer11] |
| 287 | === Genetic Programming - Multiplexer (11 inputs === |
| 288 | [attachment:SGP_Boolean-Multiplexer-11.hl] |
| 289 | A genetic programming algorithm to synthesize the boolean multiplexer function with 11 binary inputs |
| 290 | |
| 291 | * Population size: 4000 |
| 292 | * Generations: 100 |
| 293 | * Function set: IF, AND, OR, NOT |
| 294 | * Terminal set: A0, A1, A2, D0, D1, D2, D3, D4, D5, D6, D7 |
| 295 | |
| 296 | ==== References ==== |
| 297 | John R. Koza, Genetic Programming - On the Programming of Computers by Means of Natural Selection, MIT Press, 1992 |
| 298 | |