Project 2

Due 3/11

In this project we will implement several different versions of local search in python.
  1. Hill Climbing Search
  2. Simulated Annealing
  3. Genetic Algorithm
Each one should take as an argument a pointer to a function (which you are going to be finding the global maxima of), and how many parameters the function takes. Later today I'll post some sample functions for you to test it with. For now, you can test with simple 2D examples. Once you're done coding, you should write a brief report describing the performance of each search on the various samples. The sample functions are here