You need not to go from 1 up to n. You should find an optimal stopping point / upper-boundary where you can obtain all te divisors of n.

I am afraid you should read again the description. This test is the same in all languages.

Any arithmetic/bitwise operator (except + (unless it's unary) where strings take precedence) converts operands to numbers. For better understanding of sort you can check out MDN docs.

nope, not at all. ;)

It is a bad practice to have a 'magic number' in a code, here it is 6

the star operator unpacks the sets into individual arguments

Not needed but it's up to you.

Thank you, I'm glad you enjoyed this kata.

The description already lets you know "If you hit any walls or go outside the maze border, you should return Dead."

Time it?

You could try, but you'll also need to change more than that to make your code work.

The part that's checking for ending 0s indeed looks incorrect.

1. x[i:] by itself does nothing. Slicing creates a new string (no changes to original x), but you're not saving it to a variable.
2. I'm not sure I can follow your logic in the if block. It doesn't really check for '0' anywhere. You should try using some string methods that python provides. (len, replace)
3. You can avoid that if block entirely and strip off the ending if you know basic regex (look up python re module)

Good luck!

Your code skips values like that. And mutating the input is bad practice. See what your code does here.