Hrmph, care to look at my code then? Because I've stared myself blind on it xD
Here's the entire A* algo: http://pastebin.java-gaming.org/5a331617b43
The Node: http://pastebin.java-gaming.org/a33117b7340
And my super epic awesome *cough* Runner: http://pastebin.java-gaming.org/3311b837044
Actually, nevermind. I just fixed it myself. xD Or at least it isn't crashing anymore. Added "neighbor.came_from = null;" inside the if statement on line 46. xD
Though other feedback would be welcome. The assignment is to make pathfinding(what I've done now) and then be able to easily change it to be able to perform "logical deduction in propositional logic on clause form." I'm hoping that all I have to change is the Node, the way I've done it.
Actually, I still think there's a bug in it, because it shows waaay too many nodes as being visited, compared to what I'd expect of A*. :/
Edit edit edit:
There *is* a bug in it.
Searching for a path from (0,2) to (0,7) in a grid of 20x20, it doesn't find the shortest path.
Time to debug.