def beta_pruning_actions(state):
    """ Return actions available given a state, we're essentially creating
    a binary tree, where each parent has two nodes to choose from

    :param state: The current state
    :return: The available actions given the current state
    """
    match state:
        case "a":
            val = ["a1", "a2"]
        case "b":
            val = ["b1", "b2"]
        case "c":
            val = ["c1", "c2"]
        case "d":
            val = ["d1", "d2"]
        case "e":
            val = ["e1", "e2"]
        case "f":
            val = ["f1", "f2"]
        case "g":
            val = ["g1", "g2"]
        case _:
            val = []  # Cases e-m are leaves, so should have no possible actions
    return val