AoC_2019_05

array[1..6] of var 0..9: answer;
int: minimum;
int: maximum;

% In range minimum-maximum
constraint answer[1]*100000 + answer[2]*10000 + answer[3]*1000 + answer[4]*100 + answer[5]*10 + answer[6] >= minimum;
constraint answer[1]*100000 + answer[2]*10000 + answer[3]*1000 + answer[4]*100 + answer[5]*10 + answer[6] <= maximum;

% Two adjacent digits are the same without being a part of a larger group of identical digits
constraint
  (answer[1] == answer[2] /\ answer[2] != answer[3]) \/
  (answer[2] == answer[3] /\ (answer[1] != answer[2] /\ answer[3] != answer[4])) \/
  (answer[3] == answer[4] /\ (answer[2] != answer[3] /\ answer[4] != answer[5])) \/
  (answer[4] == answer[5] /\ (answer[3] != answer[4] /\ answer[5] != answer[6])) \/
  (answer[5] == answer[6] /\ answer[4] != answer[5]);

% The digits never decrease
constraint answer[1] <= answer[2] /\ answer[2] <= answer[3] /\ answer[3] <= answer[4] /\ answer[4] <= answer[5] /\ answer[5] <= answer[6];

solve satisfy;