Queques - filipondios/eight-puzzle GitHub Wiki

This is quite an important topic. We must use queues to store nodes to explore and so on. We also cannot use a normal (simple) queue because our heuristic, although it never overestimates the true cost, is rarely equal to it.

For this reason, we must use priority queues, with an order that will be calculated in the creation of the node, being the sum of its depth plus its heuristics. This will give us a good comparison when it comes to organizing the nodes into these queues.