Hello Codeforces community,
Here is a problem: http://www.spoj.com/problems/SOLVING/
How would you solve it? I don't want to skew your view, so I just leave the question without mentioning my (apparently too slow) solution.
Thanks, tom
Hello Codeforces community,
Here is a problem: http://www.spoj.com/problems/SOLVING/
How would you solve it? I don't want to skew your view, so I just leave the question without mentioning my (apparently too slow) solution.
Thanks, tom
Hm?
Did you try using A-Star algorithm? I think search space is too big even for this algorithm but you can give it a try. Since optimal solution is not required you may use non-consistent heuristic to speed up the search.
Yes. My algorithm looks as follows:
My heuristic is simple sum of manhattan distances between current point and destination point for tiles <= i.
It works well except two last rows. Sometimes it takes a lot of time to finish them.
My bad XDDDD, ignore, its stupid
Look at the constraints, board can be up to 10x10