Have you ever tried to do the brainteaser below, where you have to connect the dots to make the outline of a house in one continuous stroke without going back over your lines? Or perhaps you've ...

constraint satisfaction problems, or CSPs for short, are a flexible approach to searching that have proven useful in many AI-style problems CSPs can be used to solve problems such as graph-coloring: ...

Graph colouring, the assignment of colours to the vertices of a graph so that no two adjacent vertices share the same colour, represents a canonical NP-hard combinatorial optimisation problem with ...