Category Archives: 2005


This is the mother of all constraint applications :-). If you understand how humans solve Sudoku puzzles, then you understand how computers solve finite domain constraint programs. A Sudoku puzzle is typically presented as a 9×9 grid, with some cells … Continue reading

Posted in 2005, ECLiPSe, ModRef Workshop, Other, puzzle | Tagged , , , | Leave a comment