Hill Climbing

function hillclimbingPathfind(grid, start, end, allowDiag, hFn) {
  const h = hFn || HEURISTICS.manhattan;
  const prev = new Map();
  let r = start[0];
  let c = start[1];
  for (let step = 0; step < grid.length * grid[0].length; step++) {
    visitNode(r, c);
    if (r === end[0] && c === end[1]) {
      reconstructPath(prev, start, end);
      return;
    }
    const neighbors = getNeighbors(grid, r, c, allowDiag);
    let best = [r, c];
    let bestH = h(r, c, end[0], end[1]);
    for (const [nr, nc] of neighbors) {
      const hv = h(nr, nc, end[0], end[1]);
      if (hv < bestH) {
        bestH = hv;
        best = [nr, nc];
      }
    }
    if (best[0] === r && best[1] === c) break;
    prev.set(key(best[0], best[1]), [r, c]);
    r = best[0];
    c = best[1];
    pushFrontier(r, c);
  }
  reportNoPath();
}

def hillclimbingPathfind(grid, start, end, allowDiag, hFn):
    h = (hFn or HEURISTICS.manhattan)
    prev = Map()
    r = start[0]
    c = start[1]
    for step in range((grid.length * grid[0].length)):
        visitNode(r, c)
        if ((r == end[0]) and (c == end[1])):
            reconstructPath(prev, start, end)
            return
        neighbors = getNeighbors(grid, r, c, allowDiag)
        best = [r, c]
        bestH = h(r, c, end[0], end[1])
        for nr, nc in neighbors:
            hv = h(nr, nc, end[0], end[1])
            if (hv < bestH):
                bestH = hv
                best = [nr, nc]
        if ((best[0] == r) and (best[1] == c)):
            break
        prev.set(key(best[0], best[1]), [r, c])
        r = best[0]
        c = best[1]
        pushFrontier(r, c)
    reportNoPath()

#include <vector>
#include <algorithm>
void hillclimbingPathfind(int grid, int start, int end, int allowDiag, int hFn) {
    auto h = (hFn || HEURISTICS.manhattan);
    auto prev = Map();
    auto r = start[0];
    auto c = start[1];
    for(int step=0; step<(grid.length * grid[0].length); step++) {
        visitNode(r, c);
        if(((r == end[0]) && (c == end[1]))) {
            reconstructPath(prev, start, end);
            return;
        }
        auto neighbors = getNeighbors(grid, r, c, allowDiag);
        auto best = [r, c];
        auto bestH = h(r, c, end[0], end[1]);
        for(auto& [nr, nc] : neighbors) {
            auto hv = h(nr, nc, end[0], end[1]);
            if((hv < bestH)) {
                bestH = hv;
                best = [nr, nc];
            }
        }
        if(((best[0] == r) && (best[1] == c))) {
            break;
        }
        prev.set(key(best[0], best[1]), [r, c]);
        r = best[0];
        c = best[1];
        pushFrontier(r, c);
    }
    reportNoPath();
}

public void hillclimbingPathfind(int grid, int start, int end, int allowDiag, int hFn) {
    var h = (hFn || HEURISTICS.manhattan);
    var prev = Map();
    var r = start[0];
    var c = start[1];
    for(int step=0; step<(grid.length * grid[0].length); step++) {
        visitNode(r, c);
        if(((r == end[0]) && (c == end[1]))) {
            reconstructPath(prev, start, end);
            return;
        }
        var neighbors = getNeighbors(grid, r, c, allowDiag);
        var best = [r, c];
        var bestH = h(r, c, end[0], end[1]);
        foreach(var (nr, nc) in neighbors) {
            var hv = h(nr, nc, end[0], end[1]);
            if((hv < bestH)) {
                bestH = hv;
                best = [nr, nc];
            }
        }
        if(((best[0] == r) && (best[1] == c))) {
            break;
        }
        prev.set(key(best[0], best[1]), [r, c]);
        r = best[0];
        c = best[1];
        pushFrontier(r, c);
    }
    reportNoPath();
}

#include <stdio.h>
void hillclimbingPathfind(int grid, int start, int end, int allowDiag, int hFn) {
    var h = (hFn || HEURISTICS.manhattan);
    var prev = Map();
    var r = start[0];
    var c = start[1];
    for(int step=0; step<(grid.length * grid[0].length); step++) {
        visitNode(r, c);
        if(((r == end[0]) && (c == end[1]))) {
            reconstructPath(prev, start, end);
            return;
        }
        var neighbors = getNeighbors(grid, r, c, allowDiag);
        var best = [r, c];
        var bestH = h(r, c, end[0], end[1]);
        for(int _fod_i = 0; _fod_i < neighbors_len; _fod_i++) {
            int nr = neighbors[_fod_i][0];
            int nc = neighbors[_fod_i][1];
            var hv = h(nr, nc, end[0], end[1]);
            if((hv < bestH)) {
                bestH = hv;
                best = [nr, nc];
            }
        }
        if(((best[0] == r) && (best[1] == c))) {
            break;
        }
        prev.set(key(best[0], best[1]), [r, c]);
        r = best[0];
        c = best[1];
        pushFrontier(r, c);
    }
    reportNoPath();
}