Code and Results for Chapter 11

• gp.py
  
  • evolve now keeps track of the number of times we have seen the same score and exits if evolution appears to stall
  • there is now an implementation of the euclidean distance node
  • there is now an implementation of a division node
  • we now have several alternative numerical functions to try and develop genetic programs to optimize noised_hiddenfunction and inverse_hiddenfunction
  • implemented a function_replacement_mutate routine that replaces a function with another random one
• run_all.py (runs and demonstrates the code presented in this chapter)
  
• chap_11_ex_2.py (demonstrates the code written for this exercise)
  
• chap_11_ex_5.py (demonstrates the code written for this exercise)