A telecom planner must assign radio channels to thousands of towers. Trying every assignment would run past the maintenance window. The team uses a fast rule that returns a good assignment without proving it is the best one. What is that rule?
Select an answer to reveal the explanation.
Short Explanation
When the maze has more paths than you have minutes, you take a good marked trail instead of proving you walked them all. That channel rule is a heuristic, a practical shortcut when exact search does not fit the window. The trap is describing it as an exhaustive search that still guarantees the best assignment.
Full Explanation
The assignment space is too large to enumerate before the maintenance window closes, and the team still needs a workable channel plan. A heuristic is a practical shortcut that searches part of that space, or follows a fast constructive rule, and returns a good assignment without a proof that no better assignment exists. That matches a fast rule with no optimality certificate. An exhaustive search that stops when the clock ends has not tried every assignment, so it does not retain a proof that the kept plan is optimal. A closed-form optimum would mean the best plan falls out of one formula with no search; the stem describes a search that was too large, not a formula that avoids search. Drawing one feasible plan and calling all feasible plans equal ignores that channel assignments differ in interference and capacity. Exam caveat: a heuristic can land on the best plan by chance on a given day; chance is not a proof from exhaustive search. Operational check: confirm the run finishes inside the window and that the report does not claim a certificate of optimality.