Please I want explaining in details about cryptarithmetic p

Solution

Constraint satisfaction problem:

It’s define a set of variables, to which values must be assigned, and a set of constraints that restrict these assignments. Since many problems of practical interest require a dynamic environment, the model of CSP was extended to a dynamic CSP (DCSP), in which the set of variables and/or constraints can be modified during the constraint resolution process

    BASE

  + BALL

  GAMES

Variables A, B, E, G, L, M, S

Domains :{ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9}

Constraints

                 Alldiff (A, B, E, G, L, M, S)