I thought i had the same issue,
but turns out it had to do with rank being -1 and self.rank being 1.
description states there is no rank 0 so rank -1 and 1 are consecutive

WARNING:

I'm fairly certain the tests are bugged for the Python version of this problem (unsure of others). The issue has to do with the following line in the problem description:

"Any activities completed that are ranking 2 levels or more lower than the user's ranking will be ignored"

Tests I've run indicate some of the tests account for this properly, while other tests still provide 1 point of progress for all problem ranks below the user's rank. As far as I can tell, the tests will need to be fixed before a solution can be properly validated. As it stands my program fails one set of tests when built one way, and fails the other set of tests when built the other.

Please don't spoil solutions on the discourse page. This is basic arithmetic, everyone is supposed to solve it by trying and searching (and failing, that's part of the process), not by reading the discourse page.

You can use the console temporarily to see what cases are being run, but there is a performance impact you should be aware of when submitting.

Thanks! I used your advice. However, in C inefficient solutions (checking the modulus for all numbers between 1 and the input) also pass without timing out. Seems kind of unfair.

I actually ran into the same issue, as I thought that N * N means all mazes have the same width and height. Only through the comment here I got the idea that the description was missleading.