International Conference on Communication, Management and Information Technology
KenKen puzzles are popular logic puzzles similar to the ubiquitous Sudoku puzzles. However, solving KenKen puzzles requires more than making sure that numbers are used only once in a row and column of a matrix. In fact, depending on the size of the NxN grid, the number (and size) of the cages, as well as the arithmetic operations used, a KenKen puzzle offers a formidable challenge for logic puzzle fans. This paper proposes a methodology based on the Cartesian Product of viable sets representing the several cages. The implementation uses SAS® an application software package that generates the viable sets for each cage straight-away and solves the puzzle by identifying the only appropriate aggregate collection of cage-specific sets..