A heuristic is a way of trying

• A. To discover something or an idea embedded in a program
• B. To search and measure how far a node in a search tree seems to be from a goal
• C. To compare two nodes in a search tree to see if one is better than the other is
• D. All of the mentioned