An instance of the Symbolic-Regressor-Applet will appear in a Java enabled browser.
To come soon:
input1 input2 input3 output 1 23 42 65 2 24 43 91 3 25 44 119 4 26 45 149 5 27 46 181 6 28 47 215 7 29 48 251 8 30 49 289 9 31 50 329 10 32 51 371 11 33 52 415 12 34 53 461 13 35 54 509 14 36 55 559 15 37 56 611 16 38 57 665 17 39 58 721 18 40 59 779 19 41 60 839 20 42 61 901 21 43 62 965The first 3 columns are your inputs, the last column is the ouput.
| parameter | meaning |
| population-size | The size of the population of individuals. Symbolic Regressor is quite memory efficient, so you can try large population sizes (> 5000). |
| tournament-size | Tournament selection takes tournament-size randomly and selects the best individual. |
| initialization-depth | The initialization depth is depth of the function trees (individuals) in the first generation. |
| generations | How many generations you want Symbolic Regressor to run. |
| crossover-prob. | The probality of crossover. ;) |
| node-mutation-prob. | Symbolic Regressor uses point mutation. If an individual is subject to mutation, evry node in this inidividual gets changed with this probality. |
| number of constants | Symbolic Regressor uses ephemeral constants. This means that pool of constants has a fixed size. |



