Jose Balcazar, Sarah Hancock
Faculty Sponsor: Dr. Ramanujan
KenKen puzzles, similar to Sudoku, involve strategy, planning, and logic. We aim to solve this constraint satisfaction problem (CSP) efficiently, expanding the least number of nodes possible in the search space of the problem. From the start state of the board, we implement depth first search (DFS) with the arc consistency algorithm (AC-3) to search for the goal state of the board. We also experiment to see how varying the difficulty of the puzzle, by modifying the size of the board or the number of valid operators, affects search complexity.