elvis de abreu wrote:My problem is that right now my A* algorithm in java can find the path only if it goes from top down and from left to right. I want the code to be able to check top bottom left right before deciding where to move not only bottom and right. Can you guys help me? This is my code
Welcome elvis.
1. That is a
fabulous amount of code.
(a) Given that our normal guideline is to compile every
10 lines and
test every method, I wonder how you got this far before running into a problem.
(b) We're all volunteers here, and it's unlikely that anyone is going to want to plough through 330-odd lines of code without
detailed analysis from you of what your problem is.
2. Your code lines are
far too long, which makes your code (and
thread) difficult to read.
A* is NOT a simple algorithm, so anything you can do to help us out is likely to get you answers much quicker.
Winston