map-predict_expand_seed.py

def expand_seed(h0: int, h1: int,
                max_branch: int = 3,
                max_length: int = 10) -> list[PredictedPath]:
    final = []
    seed = PredictedPath.from_seed(h0, h1, max_length)
    paths = expand_path(seed, max_branch)
    while len(final) < max_branch:
        expanded = []
        for p in paths:
            expanded.extend(expand_path(p, max_branch=max_branch))
        paths = sorted(expanded, reverse=True).copy()

        filtered = []
        for p in paths[:max_branch]:
            if p.step == max_length:
                final.append(p)
            else:
                filtered.append(p)
        paths = filtered.copy()
    return final