The Farmer Was Replaced: "The Maximum Comparison Depth Has Been Reached" Bug Callstack… (Workarounds)

The problem

how to reproduce error: checked_points = [] map = [] ws = get_world_size() # it's 32 for x in range(ws): for y in range(ws): map.append((x, y)) for p in map: if p not in checked_points: checked_points.append(p) if p in checked_points: quick_print('len ', len(checked_points)) and on len near 483-494 you will get this Error: The maximum comparison depth has been reached. This could happen, for…

What players suggest

It's not affected by the callstack but the limit on the comparison depth. They are two different things. T he callstack is only for functions and is 1100. The comparison depth are for things like in, min, max, etc. That is set at 1000. I've already explained how the comparisons work. But they are separate things. The limits are set for different things. They are enforced caps.

Yeah, it's a bit of a misnomer. Comparisons are implemented using a recursive algorithm, but comparison depth is a limit on the total number of comparisons performed (computation time), not a limit on the recursion depth (memory). Slight correction: Dictionaries and sets are not ordered, which is why lists still have a purpose. The game doesn't really tell you why looking up keys in dictionaries…

Slight correction: Dictionaries and sets are not ordered, which is why lists still have a purpose. The game doesn't really tell you why looking up keys in dictionaries and sets is faster, just that it is. In reality, it involves hash tables[docs.python.org] which are even better at this than the game makes it seem. But yes, if you want to keep track of a set of things for which a fact is true…