Fixed

There is no description in the errors. Information should be provided on what happened.

Very nice, quite tricky figuring out how the ties work as usual, thanks.

OMG. I didn't know that was possible, naive of me. Is there any solution to that problem? Maybe use Reflection?
The kata deals with two interesting theoretical aspects, I think it may be of interest. Any suggestions to solve it?

https://www.codewars.com/kata/reviews/65e5efa97b199100017cd19d/groups/65e609081886bf0001629883

I don't see how you can enforce your constraints. The current check is code text based, which can easily be circumvented. Also look at current solutions what kind of mess you'll be getting yourself into trying to restrict against these.

Efficiency is mandatory, there is a solution in O(n^3) but there is one in O(log n *n^2).

Is n the room size (assuming square room) or the number of stains?

Because those are independent parameters that can each affect how long a solution runs for.

E.g. a 10000 by 10000 room with a single stain vs a 100 by 100 room with 9999 stains (every non-start tile is a stain).

why the dogs[2] don´t move to the nearest food on 3?
in the description say:
HOWEVER, if the two dogs surrounding him are at the same distance away from him, then the dog will be confused and he'll stay in place, losing his turn to eat for that round.

perhaps that is the problem

Have you checked why the solution in the question below doesn't work?

solved, ty

.

I´m in agree, some solutions only works if elements in the list has len <= 3

I'm just missing some error message in the Test Cases, would be nice knowing what the input was that I failed on.