Dynamic content management systems may not be suited to certain, common work loads. We consider an alternative in the form of static site generators, including flexible editors. When is this alternative appropriate and how can we emulate dynamism within that paradigm?
Sudoku problems can be solved using many different types of algorithms, but utilizing a relational database might not jump to mind. Using SQL as a spring board, we introduce the basic concepts of constraint programming. The methodology is used to easily and concisely solve sudoku-like problems.