How its done?
To get the best possible solution, we uses 3 types of algorithm with an iteration limit of up to only 5,000. Our AI-powered solver find and save the shortest path of all solved problems and matches these path faces with the new path to reuse the solution, that way it gives answers in second and less iteration.
A-star Search Algorithm
Uses pathfinding to check each nodes and keeps tracks of the visited nodes until it finds the solution. The longest depth we used is up to 10,000 nodes.
Breadth-first Search Algorithm
If other algorithm cannot solve the problem, we uses traversing or a search tree structure to find solution. The depth is limited to 10,000 nodes.
Depth-first Search Algorithm
Lastly, this algorithm find the solution from a node branch as far as possible with a limit of 15,000 nodes for each. Giving you answers for all possible combinations.