Slide Set 2: State-Space Search 26
ICS 271, Fall 2007: Professor Padhraic Smyth
State-Space problem formulation
-any arrangement of n<=8 queens
-or arrangements of n<=8 queens in leftmost n
columns, 1 per column, such that no queen
attacks any other.
no queens on the board
-add queen to any empty square
-or add queen to leftmost empty square such that it is not attacked by other queens.
8 queens on the board, none attacked.
1 per move