COMP90054 Chap.3 Heuristic Search and A-star
Heuristic Search and A-star
Define heuristic
The course material gives this chapter a concrete anchor: Week 3 materials cover heuristic search and how problem relaxation yields estimates. That heuristic anchor controls how admissibility is explained and how consistency is tested in changed practice.
Heuristic Search and A-star turns heuristic, admissibility and consistency into executable reasoning.
The chapter's practical target is to apply A-star and audit the heuristic needed for the claimed optimality, so every explanation should connect syntax to program state, control flow and observable output.
Treat heuristic as a precise program object, not a loose label. Identify the value or responsibility of heuristic before execution, then trace what can read it, change it or depend on it.
This makes state changes visible before they become debugging guesses.
Use admissibility to explain the program's next move. Work through one representative admissibility input by hand and name the branch, iteration or call that follows.
If the admissibility trace cannot be stated, the code may run by accident rather than by understood design.
Formula checkpoint: heuristic
A-star combines cost already incurred with estimated remaining cost.
Trace admissibility
Bring in consistency as the test of structure.
Compare normal, boundary and invalid inputs for consistency; state the expected behaviour first; then use the mismatch between expectation and result to localise the defect.
For the application — apply A-star and audit the heuristic needed for the claimed optimality — write the smallest complete example that exposes the rule.
Explain why the consistency result works, what would break it and how the program should signal or recover from that failure.
Before running an example involving heuristic, make a trace table with the important state before and after each operation. Include the value associated with heuristic, the control decision governed by admissibility and the output or object affected by consistency.
The heuristic table turns an unexplained result into a sequence that can be tested one transition at a time.
Test three inputs: an ordinary case, a boundary case and an invalid case. State the expected consistency result for each before execution, then compare it with what the program actually does.
A useful test of admissibility isolates one rule; changing several conditions at once cannot reveal which condition caused the failure.
Test with consistency
Practise explaining the solution without reading the code.
For comp90054, name the data representation, the control flow, the responsibility of each function or class and the reason the chosen design supports apply A-star and audit the heuristic needed for the claimed optimality.
This consistency rehearsal matters when a written test or interview asks why the program works rather than whether it produces one correct output.
A complete response should make the task visible before the detail: identify what must be decided, define the relevant terms, connect the evidence to admissibility, and use consistency to test the result.
The final sentence about consistency should answer the question actually asked rather than merely repeat the topic.
The controlling limit is specific: An informative heuristic can still be invalid, expensive or misleading under a changed state representation.
Keep that consistency limit beside the worked example, because it separates a careful comp90054 answer from one that sounds confident but claims more than the task or evidence supports.
For revision, retrieve heuristic, admissibility and consistency without notes, explain their relationship aloud, then complete a changed version of the application: apply A-star and audit the heuristic needed for the claimed optimality.
Record the first failed admissibility reasoning move and repair it before attempting another case.
What this chapter covers
- 01
heuristic
- 02
admissibility
- 03
consistency
- 04
Applying heuristic
- 05
Limits of admissibility and consistency
Order an A-star frontier
- 1Compute f = g+h for each node.
- 1Obtain 9, 8 and 10.
- 1Choose the node with f=8.
- 1State the tie and optimality conditions.
Key terms
- heuristic
- Estimate of remaining cost or distance from a state to a goal. This chapter uses the concept when students apply A-star and audit the heuristic needed for the claimed optimality. Use this definition when the task is to apply A-star and audit the heuristic needed for the claimed optimality.
- admissibility
- Property that a heuristic never overestimates true remaining optimal cost. It helps explain the reasoning required to apply A-star and audit the heuristic needed for the claimed optimality. Use this definition when the task is to apply A-star and audit the heuristic needed for the claimed optimality.
- consistency
- Property requiring heuristic change across an edge not to exceed that edge cost. Its limit matters because an informative heuristic can still be invalid, expensive or misleading under a changed state representation. Use this definition when the task is to apply A-star and audit the heuristic needed for the claimed optimality.
Heuristic Search and A-star FAQ
What is the main task in Heuristic Search and A-star?
Apply a-star and audit the heuristic needed for the claimed optimality.
How do heuristic and admissibility work together?
Use heuristic to establish the object or condition, then use admissibility to explain how it changes the outcome being analysed.
What must a comp90054 answer qualify here?
An informative heuristic can still be invalid, expensive or misleading under a changed state representation.
How should I revise Heuristic Search and A-star?
Retrieve heuristic, admissibility and consistency, apply them to a changed case, and correct the first point where the evidence no longer supports the conclusion.
Exam move
Reconstruct the relationship among heuristic, admissibility and consistency; complete the chapter application without notes; then test the result against this limit: An informative heuristic can still be invalid, expensive or misleading under a changed state representation.
Working through Heuristic Search and A-star in COMP90054? Sia is AskSia’s AI Artificial Intelligence tutor — ask any COMP90054 Heuristic Search and A-star question and get a clear, step-by-step explanation grounded in how COMP90054 is taught and assessed. Read this chapter free, then take your hardest questions to Sia.
