crashteamalphing

No, I don't know Ruby, sorry . I actually downloaded RPGMaker just to look at how Pokemon Reborn was made and all (I wanted to try and fix the Shell Bell and Knock Off because I was tired of only gaining 1HP each turn, and not getting my 50% power boost, but I couldn't even find where the scripts that implemented Shell Bell or Knock Off were xD).

Hm, well if you don't know c++, you're not gonna understand the code. However, you don't need to understand it to run it. Just copy and paste the code into a text editor, and save the file as whatever.cpp. Then you'll need a program that can compile and run this code for you, but I can't really be of much help here because I'm not very knowledgeable on the subject. All I can say is that I personally use a Mac and the program I use is called Xcode. I remember using Geany on Linux once. As for PC, I don't know. If you manage to run it though, it looks like that (using my previous example for the initial state of the tile puzzle) : So you need to find out the initial state of your puzzle (each tile has a value between 0 and 3 with 0 corresponding to the correct orientation, and +1 each time it rotates, modulo 4), I explained in original post the numbering system for the tiles (1-16). Then you put those values in, and the program starts going through every possibility, warning you with a iteration n.x to let you know of how many possibilities (iterations) the program has already searched (there are about 4200000000). Every once in a while it finds a solution. x turns means you've got to click x times on the given tile.

So last night I was trying to solve that puzzle, and after 5 minutes I realized I was just wasting my time and there was a much easier solution. I made a code in c++ that goes through all 4^16=4.2 billion possibilities of moving tiles, and see which ones lead to solving the puzzle, given the initial rotation state of all tiles. Unfortunately 4.2 billion is a large number, so the code takes a very long time to be executed (like, hours or days). However, what is interesting is that there seems to be more than 1 correct way of reaching a given final state from a given initial state. For example, I had the following initial state : 0000 0000 0000 2002 where 0 represents a tile that is correct, and each time a tile rotates, it increases by +1 (modulo 4, i.e. 4=0). I had only gone through the first billion possibilities (25%) and I had already found 16 different solutions. However, I found 0 solutions in the next billion which leads me to believe that there are only 16 solutions every time the puzzle is solvable. (since there are 4^16 final states, and 4^16 possibilities of moving tiles, if there are 16 ways of reaching some final states, that also means that only 1/16 final states are reachable, luckily the correct solution is one of them). Anyway, apparently the initial state of the puzzle is different each time you play, so I can't just post the solution like that. Best I can do is to give you the code I used. Once you manage to run it, you just enter for each 16 tiles their current rotation state (0,1,2,3), and it finds for you how many times you have to click on each tile to solve the puzzle (for example, click twice on tile 1, don't click on tile 2, click 3 times on tile 3, etc...). The tiles are numbered as follows : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 The code :