Instructions
- Read the Logic Briefing below to understand how solving grid puzzles connects to algorithmic thinking and computer science.
- Complete Game 1 (The CODING Wordoku): Fill in the 6x6 grid using the letters C, O, D, I, N, G according to the standard rules.
- Complete Game 2 (The Classic 9x9): Solve the medium-difficulty numerical Sudoku grid.
- Fill out the Logic & Strategy Tracker: Document the logical steps you used to solve key intersections.
- Answer the Reflection Question at the end to connect these puzzles to real-world software engineering concepts.
Logic Briefing: Constraint Satisfaction
In computer science, Sudoku is a classic example of a Constraint Satisfaction Problem (CSP). When software engineers program an AI to solve puzzles or schedule flights, they use algorithms like backtracking search. Backtracking works systematically:
- It places a candidate value in an empty space.
- It checks if any rules (constraints) are broken.
- If a rule is broken, it