TITLE: All About M.E. Mutations in Evolution

AUTHOR: Alex Wong

SCHOOL: Somerville High School

SCHOOL ADDRESS: 81 Highland Avenue, Somerville, MA 02144

The purpose of this project is to demonstrate the effects and benefits of mutations on evolution through the use of a genetic algorithm programmed in the C language. The objective of the computer program incorporated in this project will be to have a population of randomly initialized individuals strive towards "perfection". The user will decide whether or not mutations will be allowed. My hypothesis is that a population will reach perfection every time mutations are allowed but seldom when they are not.

The computer program works as follows: 1) randomly initialized a population; 2) let the population mate to create offspring; 3) give each individual a score based on their fitness level determined by their traits: 4) sort the population according to scores; 5) kill the weak individuals for only the strong survive; 6) if it's the correct time, either enter a mutation into the population or terminate the program; 7) check to see if an ideal or "perfect" population has been reached yet; 8) repeat steps 2-7 until an ideal population has been reached.

My results contain no quantitative data since initial populations and mutation insertions are always randomly done. Several critical observations have been made, however. First of all, when mutations were allowed, ideal populations were reached every time. On the other hand, when mutations were not allowed, ideal populations were seldom reached. A mutation never had a negative effect on the population; it either had no effect whatsoever, or a positive effect. This is because individuals that were effected by a bad mutation never survived to the next generation.

My hypothesis was proven correct by my results. I believe that with my computer program, I have shown effectively the advantages of mutations and their effects on evolution.