Sweet

If there are multiple targets that have both the largest size and shortest movement distance, priority is set in clockwise rotation, starting from the 12 position

12 means 12 o'clock, i.e. noon, on a clock. for a distance of 2 this would give the following priorities for the blob S:

            y
    .------------->
    | 14 15 0 1 2
    | 13        3
 x  | 12    S   4
    | 11        5
    v 10  9 8 7 6

I got the same test error as Alan-Turing13.

I agree with him that [8,3,4] should move towards [9,6,3] instead of [5,6,3] because the first goes to the right, the second to the left.

Are there other criteria for the movement that are missing in the description?

very goood

python new test frameworks

done

Came up with the technical task first, then created a story to fit it.

Nice kata. Where does the idea of the lore come from ?

Fun kata :D

And finally I'm done!!! Found a couple of bugs in solution logic (lack of extra loop).

The clue was extreme logging/printing when debugging move by move and even shot by shot!

And finally I'm done!!! Found a couple of bugs in solution logic (lack of extra loop)

The clue was extreme logging/printing when debugging move by move and even shot by shot!

But still of by one sometimes in the random tests... :/

It's seems I bumped into the same issue. I pass all the test except 2-3 random tests when the result is different by 1.
Two different solutions. But probably I implement the same bug twice. BTW, with the map you posted above. I think I don't understand the shooting timing properly or... I don't know(. And can't find the clue in the instructions and comments.
Could you recall the kata and give me some hint? Though 7 years have passed:(((

"even if the targeted enemy has been killed by a previous (in the alphabetic order) turret, the shot is counted"
Don't understand( Could you clarify please?