Hill Climbing

From Algorithmist
Jump to navigation Jump to search
This is a stub or unfinished. Contribute by editing me.

The hill climbing heuristic climbs to the nearest maxima. It can be modified by forcing the heuristic to restart at another location to see if there is a higher maxima