1.5. Rook jumping maze generation (more on rook jumping mazes). Design a solution for rook jumping maze generation using hill-climbing by formalizing state representation, initial state, heuristic. Determine what algorithm will work best and why.
2.75. CSPs. Describe the game of Set (rules of the game) as a CSP. Use Backtracking search to solve the daily puzzle. You may also try it out on the sample from class. Hint: define a language that compares Pattern(), Shape(), Color(), and Number() of cards.