After deciding what my project will be, I've been getting familiar with Gradle (Java dependancy manager) and I created a walking skeleton of the project. There is no functionality besides a crude GUI where you can load an image.

I've learned about Gradle and that JPS is an A* optimization and that IDA* is an variation of A*.

Time and space complexity of JPS is a bit unclear. I think it is portrayed the same as with A*, but the node and depth amount is significantly less (since nodes being eliminated recursively).

Next I will implement A* and JPS algorithms using the standard Java data structures and try to utilize them for finding a path on an image. I will also implement IDA* this week if i have time.