Thanks! Lack of attention on my part.

ABC are starting pieces locations. lowercase abc are targets.

test.assert_equals(kuboble(level), 14 ... etc)
...

. X . . 
a X b . 
. C cB A

Wouldn't that be just be 8 moves?

('a', 'down') - 1
('b', 'up') - 2
('c', 'up') - 3
('a', 'right') - 4
('c', 'down') - 5
('c', 'left') - 6
('b', 'down') - 7
('c', 'right')- 8

Mentally I solved this in fewer moves than the 14 in the tests.

It won't as you can have alias in Python

try:
    a
except NameError:
    nrecaman = a

Well, that just invalidated all solutions, but yeah, I agree it confused me a lot

Hi, may be better to stick to function name a instead of nrecaman - as it is in description, otherwise some confusion is possible.

.

Hey, I've published a fork for this kata. It's changes are mostly regarding the description in order to make it more language agnostic.

Please take a look at it, I can revert back any changes you disagree with.

Fixed. You might need to reset your trainer to see the fixed version of example tests.

It only seems to work on node 8

ReferenceError: Test is not defined
Looks like there a error in the Sample Tests. (JS Version)

Ok, someone already found not expected and better solution.
Going to put this kata on hold.

The main part of algorithm, it's hard to explain.
Perhaps changing the description (i has thinking about, " after the processing of ranges and etecetera").
Or just removing the commentary, but it's a helper. Yes is different N.

O(N)? But the number of elements in the result is O(len(arr)^2), so it must be bounded below by O(N^2). Or is this a different N from the length of the array?

exactly