Project Euler Forum

3 days since the problem came out and now I seem to finally have a method to compute for smaller N though not sure as I can only calculate for some values of N and not the other. Is it ok to ask if T(20) is of the form XYX?

Never mind, I can confirm T(1000) as given in the problem.

Try it

http://www.eelvex.net/games/pe-331-game/

LOL. That's a good one. Have you solved the puzzle yet? If so, you can even have a solver.

Also, cool that you used Processing.js . I used this nice library recently for one of my personal projects.

pinguin wrote:Try it

http://www.eelvex.net/games/pe-331-game/

I have an efficient algorithm that appears to work for all values that I can verify independently, but my solution is wrong and I am struggling to figure out why.

Would someone be willing to tell me if the sum of the 4 last terms (i = 28 to 31) ends with 639?

I'm really struggling with this one. I have a feeling that this sort of flipping is some classic game/puzzle, but I've failed to find any references. Can anyone tell me, what it is? I'm in desperate need of a starting place.

ffff0 wrote:I'm really struggling with this one. I have a feeling that this sort of flipping is some classic game/puzzle, but I've failed to find any references. Can anyone tell me, what it is? I'm in desperate need of a starting place.

It is Lights Out with a different move shape or Alien Tiles with only 2 colours.

Thanks!