Doing N*N*N is almost twice as fast as POW(N,3).
However, the speed of POW increases slowly as the exponent increases (while the speed of N*N*N... increases more quickly), so after around 7, POW is better.
How many times are you going to move this?
Interesting. It doesn't look nice in the code, but I might give it practice.
