Beam Search Keeps Worst Nodes

// Higher score = better; keep the top k candidates each step
function beamStep(candidates, k, score) {
  candidates.sort((a, b) => score(a) - score(b));
  return candidates.slice(0, k);
}