KenKen puzzle addends: REDUX A (corrected) non-recursive algorithm

Question

This question relates to those parts of the KenKen Latin Square puzzles which ask you to find all possible combinations of ncells numbers with values x such that 1 <= x &

Answer 1

Little bit offtopic, but still might help at programming kenken.

I got good results using DLX algorhitm for solving Killer Sudoku (very simmilar as KenKen it has cages, but only sums). It took less than second for most of problems and it was implemented in MATLAB language.

reference this forum http://www.setbb.com/phpbb/viewtopic.php?t=1274&highlight=&mforum=sudoku

killer sudoku "look at wikipedia, cant post hyper link" damt spammers