Constraint logic problem

In Computational Complexity Theory, constraint logic problems are a list of problems in constraint graph, a special graph with directed, weighted edges that satisfy special constraints (see below). These problems and their variants have been proven to be PSPACE-hard and are very useful to show various games and puzzles are PSPACE-hard or PSPACE-complete.