def most_probable(self, state_from):
        """Returns a tuple of most probable next states."""
        ret_val = ()
        try:
            counter = self._pairs[state_from]
            if len(counter):
                max_val = max(counter.values())
                ret_val = tuple([k for k, v in counter.items() if v == max_val])
        except __HOLE__:
            pass
        return ret_val
dataset/ETHPy150Open manahl/PythonTrainingExercises/Advanced/RomeoAndJuliet/solution/MarkovChain.py/MarkovChain.most_probable