Using c# we want to be able to find the global maxima from three different optimization problems. This is done using an iterative hill climber. All the problems for this project will be two dimensional.
- P1.
- P2.
- Reverse Ackley.
The fitness to this problem is described as
The fitness to this problem is described as
Reverse Ackley is the opposite of the following function:
