New answers tagged

2

It looks like you store the board after each movement for each possibility, that's a lot of arrays in memory, no wonder it fills your memory for your second example, your code looks for 157523 positions, which is half of the total possibilities. the number of permutations for 1:16 is enormous, the a-star algorithm is probably not sufficient even if you look ...


Top 50 recent answers are included