Learn: A* Algorithm - Heuristics and Informed Search
OCR H446 Computer Science Specification
Ready to start this lesson?
Sign in to track your progress. 12 steps including 6 interactive questions.
Sign In to Start Learning
Students also studied
Browse allSteps in this lesson (12)
Match the items on the left with their correct pairs on the right
Match the items on the left with their correct pairs on the right
What is the purpose of the A* algorithm?
Start the lesson to answer this multiple choice question
Match the items on the left with their correct pairs on the right
Match the items on the left with their correct pairs on the right
Start the lesson to answer this matching question
Match the items on the left with their correct pairs on the right
Which of the following is an example of an admissible heuristic?
Start the lesson to answer this multiple choice question
Match the items on the left with their correct pairs on the right
Which of the following statements are true about A* and Dijkstra’s algorithms? (Select all that apply)
Start the lesson to answer this multi-select question
Match the items on the left with their correct pairs on the right
What makes A* an informed search algorithm?
Start the lesson to answer this multiple choice question
The A* algorithm prioritises paths with the lowest {{blank0}} value, which is the sum of {{blank1}} and {{blank2}}.
Start the lesson to answer this fill in the blank question
Want to Learn More?
Get personalised lessons, quizzes, and instant feedback from your AI tutor.
Explore More Topics