<gh_stars>100-1000
"""
Generic alphametic solver in cpmpy.

This is a generic alphametic solver.

Usage:
    python alphametic.py
        ->  solves SEND+MORE=MONEY in base 10

    python alphametic.py  'SEND+MOST=MONEY' 11
        -> solver SEND+MOST=MONEY in base 11

    python alphametic.py TEST <base>
        -> solve some test problems in base <base>
            (defined in test_problems())

Assumptions:
- we only solves problems of the form
    NUMBER<1>+NUMBER<2>...+NUMBER<N-1> = NUMBER<N>
    i.e. the last number is the sum
- the only nonletter characters are: +, =, \d (which are splitted upon)



Model created by <NAME>, <EMAIL>
See also my cpmpy page: http://www.hakank.org/cpmpy/

"""
import sys,re
from cpmpy import *
import numpy as np
from cpmpy_hakank import *


def alphametic(problem_str="SEND+MORE=MONEY", base=10):

  model = Model()

  # data
  print("\nproblem:", problem_str)

  # convert to array.
  problem = re.split("[\s+=]", problem_str)

  p_len = len(problem)
  print("base:", base)

  # create the lookup table: list of (digit : ix)
  a = sorted(set("".join(problem)))
  n = len(a)
  lookup = dict(list(zip(a, list(range(n)))))

  # length of each number
  lens = list(map(len, problem))

  #
  # declare variables
  #

  # the digits
  x = intvar(0,base-1,shape=n,name="x")
  # the sums of each number (e.g. the three numbers SEND, MORE, MONEY)
  sums = [intvar(1, base**(lens[i]) - 1) for i in range(p_len)]
  #
  # constraints
  #
  model += (AllDifferent(x))

  ix = 0
  for prob in problem:
    this_len = len(prob)

    # sum all the digits with proper exponents to a number
    model += (
        sums[ix] == sum([(base**i) * x[lookup[prob[this_len - i - 1]]]
                                for i in range(this_len)[::-1]]))
    # leading digits must be > 0
    model += (x[lookup[prob[0]]] > 0)
    ix += 1

  # the last number is the sum of the previous numbers
  model += (sum([sums[i] for i in range(p_len - 1)]) == sums[-1])

  ss = CPM_ortools(model)
  # ss.ort_solver.parameters.num_search_workers = 8 # Don't work together with SearchForAllSolutions
  # ss.ort_solver.parameters.search_branching = ort.PORTFOLIO_SEARCH
  # ss.ort_solver.parameters.cp_model_presolve = False
  ss.ort_solver.parameters.linearization_level = 0
  ss.ort_solver.parameters.cp_model_probing_level = 0

  num_solutions = 0
  while ss.solve():
    num_solutions += 1
    print("\nsolution #%i" % num_solutions)
    for i in range(n):
      print(a[i], "=", x[i].value())
    print()
    for prob in problem:
      for p in prob:
        print(p, end=" ")
      print()
    print()
    for prob in problem:
      for p in prob:
        print(x[lookup[p]].value(), end=" ")
      print()

    print("sums:", [sums[i].value() for i in range(p_len)])
    print()
    get_different_solution(ss,x)

  print("\nnum_solutions:", num_solutions)


def test_problems(base=10):
  problems = [
      "SEND+MORE=MONEY", "SEND+MOST=MONEY", "VINGT+CINQ+CINQ=TRENTE",
      "EIN+EIN+EIN+EIN=VIER", "DONALD+GERALD=ROBERT",
      "SATURN+URANUS+NEPTUNE+PLUTO+PLANETS", "WRONG+WRONG=RIGHT",
      "GATHER+HOMAGE=MARTIN"
  ]

  for p in problems:
    alphametic(p, base)


problem = "SEND+MORE=MONEY"
base = 10
if len(sys.argv) > 1:
    problem = sys.argv[1]
if len(sys.argv) > 2:
    base = int(sys.argv[2])

if problem == "TEST" or problem == "test":
    test_problems(base)
else:
    alphametic(problem, base)

"""
Generic alphametic solver in cpmpy.

This is a generic alphametic solver.

Usage:
    python alphametic.py
        ->  solves SEND+MORE=MONEY in base 10

    python alphametic.py  'SEND+MOST=MONEY' 11
        -> solver SEND+MOST=MONEY in base 11

    python alphametic.py TEST <base>
        -> solve some test problems in base <base>
            (defined in test_problems())

Assumptions:
- we only solves problems of the form
    NUMBER<1>+NUMBER<2>...+NUMBER<N-1> = NUMBER<N>
    i.e. the last number is the sum
- the only nonletter characters are: +, =, \d (which are splitted upon)



Model created by <NAME>, <EMAIL>
See also my cpmpy page: http://www.hakank.org/cpmpy/

"""
import sys,re
from cpmpy import *
import numpy as np
from cpmpy_hakank import *


def alphametic(problem_str="SEND+MORE=MONEY", base=10):

  model = Model()

  # data
  print("\nproblem:", problem_str)

  # convert to array.
  problem = re.split("[\s+=]", problem_str)

  p_len = len(problem)
  print("base:", base)

  # create the lookup table: list of (digit : ix)
  a = sorted(set("".join(problem)))
  n = len(a)
  lookup = dict(list(zip(a, list(range(n)))))

  # length of each number
  lens = list(map(len, problem))

  #
  # declare variables
  #

  # the digits
  x = intvar(0,base-1,shape=n,name="x")
  # the sums of each number (e.g. the three numbers SEND, MORE, MONEY)
  sums = [intvar(1, base**(lens[i]) - 1) for i in range(p_len)]
  #
  # constraints
  #
  model += (AllDifferent(x))

  ix = 0
  for prob in problem:
    this_len = len(prob)

    # sum all the digits with proper exponents to a number
    model += (
        sums[ix] == sum([(base**i) * x[lookup[prob[this_len - i - 1]]]
                                for i in range(this_len)[::-1]]))
    # leading digits must be > 0
    model += (x[lookup[prob[0]]] > 0)
    ix += 1

  # the last number is the sum of the previous numbers
  model += (sum([sums[i] for i in range(p_len - 1)]) == sums[-1])

  ss = CPM_ortools(model)
  # ss.ort_solver.parameters.num_search_workers = 8 # Don't work together with SearchForAllSolutions
  # ss.ort_solver.parameters.search_branching = ort.PORTFOLIO_SEARCH
  # ss.ort_solver.parameters.cp_model_presolve = False
  ss.ort_solver.parameters.linearization_level = 0
  ss.ort_solver.parameters.cp_model_probing_level = 0

  num_solutions = 0
  while ss.solve():
    num_solutions += 1
    print("\nsolution #%i" % num_solutions)
    for i in range(n):
      print(a[i], "=", x[i].value())
    print()
    for prob in problem:
      for p in prob:
        print(p, end=" ")
      print()
    print()
    for prob in problem:
      for p in prob:
        print(x[lookup[p]].value(), end=" ")
      print()

    print("sums:", [sums[i].value() for i in range(p_len)])
    print()
    get_different_solution(ss,x)

  print("\nnum_solutions:", num_solutions)


def test_problems(base=10):
  problems = [
      "SEND+MORE=MONEY", "SEND+MOST=MONEY", "VINGT+CINQ+CINQ=TRENTE",
      "EIN+EIN+EIN+EIN=VIER", "DONALD+GERALD=ROBERT",
      "SATURN+URANUS+NEPTUNE+PLUTO+PLANETS", "WRONG+WRONG=RIGHT",
      "GATHER+HOMAGE=MARTIN"
  ]

  for p in problems:
    alphametic(p, base)


problem = "SEND+MORE=MONEY"
base = 10
if len(sys.argv) > 1:
    problem = sys.argv[1]
if len(sys.argv) > 2:
    base = int(sys.argv[2])

if problem == "TEST" or problem == "test":
    test_problems(base)
else:
    alphametic(problem, base)
Generic alphametic solver in cpmpy.  This is a generic alphametic solver.  Usage:     python alphametic.py         ->  solves SEND+MORE=MONEY in base 10      python alphametic.py  'SEND+MOST=MONEY' 11         -> solver SEND+MOST=MONEY in base 11      python alphametic.py TEST <base>         -> solve some test problems in base <base>             (defined in test_problems())  Assumptions: - we only solves problems of the form     NUMBER<1>+NUMBER<2>...+NUMBER<N-1> = NUMBER<N>     i.e. the last number is the sum - the only nonletter characters are: +, =, \d (which are splitted upon)    Model created by <NAME>, <EMAIL> See also my cpmpy page: http://www.hakank.org/cpmpy/ # data # convert to array. # create the lookup table: list of (digit : ix) # length of each number # # declare variables # # the digits # the sums of each number (e.g. the three numbers SEND, MORE, MONEY) # # constraints # # sum all the digits with proper exponents to a number # leading digits must be > 0 # the last number is the sum of the previous numbers # ss.ort_solver.parameters.num_search_workers = 8 # Don't work together with SearchForAllSolutions # ss.ort_solver.parameters.search_branching = ort.PORTFOLIO_SEARCH # ss.ort_solver.parameters.cp_model_presolve = False #%i" % num_solutions)