Add Simple hill climbing and steepest ascent algorithms in AI -> Algorithms #47

AI/Algorithms/HillClimbing.py

@@ -0,0 +1,12 @@
+def hill_climbing(f, x0):
+    x = x0  # initial solution
+
+    while True:
+        neighbors = generate_neighbors(x)  # generate neighbors of x
+
+        # find the neighbor with the highest function value
+        best_neighbor = max(neighbors, key=f)
+
+        if f(best_neighbor) <= f(x):  # if the best neighbor is not better than x, stop
+            return x
+        x = best_neighbor  # otherwise, continue with the best neighbor

AI/Algorithms/StepestAscentHillClimbing.py

@@ -0,0 +1,15 @@
+def steepest_ascent_hill_climbing(problem):
+
+    current = problem.initial_state()
+
+    while True:
+        neighbors = problem.get_all_neighbors(current)
+        if not neighbors:
+            break  # No neighbors found
+
+        next_state = max(neighbors, key=problem.evaluate)
+        if problem.evaluate(next_state) <= problem.evaluate(current):
+            break  # No better neighbor found
+
+        current = next_state
+    return current

AI/README.md

@@ -6,7 +6,7 @@
 
 | S.No  | Algorithm | S.No. | Algorithm | S.No. | Algorithm |
 |-------|-----------|-------|-----------|-------|-----------|
-|   1   |           |   2   |           |   3   |           |
+|   1   | Simple Hill Climbing |   2   | Steepest Ascent Hill Climbing |   3   |           |
 |   4   |           |   5   |           |   6   |           |
 
 ## Available Documentations