Not a suggestion ~~

its in closure of the operator function!
when you call a number function n at here it returns a function, that cheks if it recives a argument or not,
what if you pass th result of plus function with a value as argument of seven which recives a function?
you have the operation check part with an operation like plus with argument involved in it, l

its hard a little bit , it took me 10 min to undrestand what he did !!!!

I'm having the same problem as Yuriy and have tried what feels like a million different refactors to cut the time down.

Attempted in Javascript using a Bubble Sort and Binary Search

Mine is 12000ms and I can't pass the kata because of "Execution Timed Out" =(

I really enjoyed this Kata, thanks for making it.

Some more test cases would be good.
My code passed but if this test was run it would have failed.

validateBattlefield([
[1, 0, 0, 0, 0, 0, 0, 0, 0, 0],
[1, 0, 1, 0, 0, 1, 1, 0, 1, 0],
[1, 0, 1, 0, 1, 1, 1, 0, 1, 0],
[1, 0, 0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0, 1, 0],
[0, 0, 0, 0, 1, 1, 1, 0, 0, 0],
[0, 0, 1, 0, 0, 0, 0, 0, 1, 0],
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 1, 0, 0],
[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
]);

given the two comments bellow, we have a very consistent behaviour (irony) LOL

rKQodlw -> discard KQ and rearrange the letters -> world

That's better than mine. I got just over 8400ms. I tested the first three on the solutions page and yours was faster than them all.

This one ran the fastest for me.

Thanks for the great kata.
Codewars Rocks!

Added spoiler tag here ;)