This webpage serves as the solver for many maths problems and puzzles. Given a starting number n and two mathematical functions that may be applied to it
I.e: Doubling it, How quickly can you get from n (the initial node) to j (the final node)

It uses a Breadth-First Search to find the shortest path to the destination node, this approach is far more efficient than other searches.

However, given parameters, it may be impossible to get from n to j (For example if you start at -1 and are trying to get to 5, but you can only -1 and double). So I have added a maximum search depth to prevent going forever.

Initial Node: Target Value: Operation 1: Operation 2: Search Depth: Perform BFS