I think 1D arrays should be the fastest but I currently use 2D arrays because it's better to understand.Question:
Which is faster: 2D Arrays, 1D Arrays, Lists?
Is it faster to create local arrays that keep getting destroyed or declare global arrays?
EDIT: Also another question...(sorry about the questions)...
You know that different algorithms can solve different puzzles at different speeds. Lets say a brute-force algorithm may solve 2 different puzzles in different times.
So are you going to throw in 10 puzzles and average the time?
About local/global: I think if you create global arrays at Activity_Create and just use them it will be faster. The problem is that you don't know how many boards you need for the backtracking. Createing an array for every permutation at the beginning is not a good idea i think.
From first post:
I think Erel will use a set of puzzles. Perhaps even more than 7 as in the example because I get quite different results on my LG P500 when I call the example multiple times.Your application will be tested with a different set of puzzles.