rule

Here is a function that works fine for all cases and return the list of all first candidates encountered if no choice can be made to separate them. def find_best(list_of_lists): i = 0 while len(list_of_lists[i]) == 0: i+=1 list_containing_candidates = list_of_lists[i][:] if len(list_containing_candidates) == 1 : return list_containing_candidates[0] else: if i+1 < len(list_of_lists): for next_list … Read more