Ok, so I've implemented bfs and dfs maze solvers before, now I'm trying to implement a multithreaded maze solver, but I'm totally lost.

My train of thought it that when I reach a fork (multiple paths) I can create a worker of some sort for each path.

I'm thinking of using the executor class to create workers for each fork, but I'm not sure if this is the best method or not..

Anyone have any insight on multithreaded maze solvers?

https://www.google.com/search?q=Multithreaded+Maze+Solver

seriously dude. all kinds of tips and pseudocode

Yes I've googled extensively, my current code does horribly compared to single threaded solvers

Currently using a forkjoinpool but might just scrap it and rewrite everything.