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]
]);

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!

Nice Kata.

Great solution!

Thank you for this Kata, it has taught me a lot.

This link could be of use to anyone having trouble sorting in Javascript.
https://www.sitepoint.com/sophisticated-sorting-in-javascript/

Very impressed/confused. Thank you all for the valuable lesson.

This Kata was Great! I encourage anyone having difficulty to keep at it.

Thanks for the inspiration. Techno victory dance, ints ints ints ints.

razeyCay!

Great solution!
Could somebody please help explain how the returned function(l) holds the value it does?