represent a sub-problem as a so called store. A store is thus a node in the (virtual) search tree.Moreover, it is self-contained which turns it into a relocatable
object that can be moved between workers. The generation of new sub-problems (splitting) and propagation are similar in MaCS and PaCCS. The (virtual) search tree is traversed by incrementally extending a partial assignment toward a complete solution and repeatedly choosing a value for another variable, performing constraint propagation and keeping the previous state of variables so that it can be restored, should failure occur.