Skip to content
ml-recall

#hill-climbing

3 questions from Search & Planning, Genetic Algorithms

Timed test

3 questions · 3 min · score and explanations at the end

Take a test
Q 1 / 3Score 0 / 0

Question 1: Single choice

mediumAI-checkedSearch & Planning

Hill climbing solves the 8-puzzle by always moving to the neighbour with the fewest misplaced tiles (blank not counted). From the start state below, which move does it make first?

Start Goal
6 _ 2 1 2 3
1 8 4 8 _ 4
7 3 5 7 6 5
Choose one option