27 Jan 2005
CS 3243 - Heuristics
34
Hill-climbing search: 8-queens problem
n
n
h
= number of pairs of queens that are attacking each other, either
directly or indirectly
n
h = 17
for the above state
