Consider the problem of constructing crossword puzzles fitting words into a rectangular
grid. the grid, which is given as part of the problem, specifies which squares are blank
and which are shaded. assume that a list of words (i. e., a dictionary) is provided and
that the task is to fill in the blank squares by using any subset of the list.
• formulate this problem precisely in two ways:
o as a general search problem. choose an appropriate search algorithm
and specify a heuristic function. is it better to fill in blanks one jetter at a
time or one word at a time?
o as a constraint satisfaction problem. should the variables be words or
letters?
• which formulation do you think will be better? why?