The document discusses backtracking and the eight queen puzzle. It defines backtracking as a general algorithm that considers all possible combinations to solve computation problems. It states that backtracking can be used to solve puzzles like crosswords, sudoku, and the eight queen puzzle. The eight queen puzzle involves placing eight chess queens on an 8x8 board so that no two queens attack each other. It is an example of the more general n-queen problem and has solutions for all natural numbers greater than 3. The document also provides the formulation of the eight queen problem in terms of initial states, successor functions, and a goal test.