Always traverse to the next node with the highest value from an evaluation function. Uses a priority queue (max heap).
