def successors_of(state):
    # Generate valid moves
    valid_moves = []
    for i in range(len(state)):
        if state[i] == 1 or state[i] == 2:
            continue
        count = 1
        while count < state[i]/2:
            new_state = state.copy()
            new_state[i] = new_state[i]-count
            new_state.append(count)
            new_state.sort(reverse=True)
            valid_moves.append((count,new_state))
            count += 1
    return valid_moves