Gonna try my best to explain. I read in C# btw. So first of the sign "**" I think it is the same as 2^2, not really sure though.

so 1 is less than or eual to n and if that is true then u check for if that value is <= 2^64 - 1. Is that correct?

Hmm okay.. Could you explain how you read this "1 <= n <= 2 ** 64 - 1"? Guessing that is a vital part you need to understand to solve this.

If I need to check every combination and see if any result is equals to n. Dont I need to know the max value of the exponent?

The test doesnt tell me anything other than I failed. xD gonna chew on this some more.

I dont understand what this kata wants from me. As I understand it, if the sum is equal to 3 power of 2 which is 9.. so If n == 9 then return true otherwise false. Thats how I see it. I understand that this is not what it wants. Either this description is not suited for beginners or I'm just stupid. Could someone explain this as if I were a 5 year old?

Can someone explain what kind of calculation this kata wants from me? Right now I 'am sorting the array in descending order, splitting the are in half so I get two arrays and then subtract from the first index until there is no more elements in the array in both arrays and then I add the arrays(Sum) together.

It seems I 'am missunderstanding the description.

Problem solved, It is acutally more obvious than you think xD

If it moves all of the boxes at the same time in either direction then shouldnt there be exactly same amount of boxes on each column? Or is there something Im missing here, like is the cubes inside a box with walls so the outer cubes wont move?