S2T2

Jim Randell 3:50 pm on 28 March 2025 Permalink Reply
Tags: by: Andrew Skidmore ( 85 )   

• 

  Jim Randell 3:51 pm on 28 March 2025 Permalink | Reply

  We can use the [[ SubstitutedExpression.split_sum ]] solver from the enigma.py library to solve this puzzle.

  The following run file executes in 77ms. (Internal runtime of the generated code is 110µs).

  #! python3 -m enigma -rr
  
  SubstitutedExpression.split_sum
  
  "ONE + TWO + FIVE = EIGHT"
  
  --extra="is_prime(NOW)"
  --answer="NOW"
  

  Solution: NOW = 467.

  LikeLike

• 

  Ruud 9:17 am on 29 March 2025 Permalink | Reply

  import istr
  
  
  for o, n, e, t, w, f, i, v, g, h in istr.permutations(range(10)):
      if (o | n | e) + (t | w | o) + (f | i | v | e) == (e | i | g | h | t) and (n | o | w).is_prime():
          print("now =", n | o | w)
  

  LikeLike

• 

  GeoffR 10:12 am on 29 March 2025 Permalink | Reply

  
  % A Solution in MiniZinc
  include "globals.mzn";
  
  %      O N E
  %      T W O
  %    F I V E
  %  ---------
  %  E I G H T
  %  ---------
  %     c3c2c1
   
  var 1..9:O; var 1..9:N; var 1..9:E; var 1..9:T; var 0..9:W; 
  var 1..9:F; var 0..9:I; var 0..9:V; var 0..9:G; var 0..9:H;
  var 0..2:c1; var 0..2:c2; var 0..2:c3;
  var 100..999:NOW = 100*N + 10*O + W;
  
  constraint E == 1;
  
  constraint all_different([O, N, E, T, W, F, I, V, G, H]);
  
  predicate is_prime(var int: x) = 
  x > 1 /\ forall(i in 2..1 + ceil(sqrt(int2float(ub(x))))) 
  ((i < x) -> (x mod i > 0));
  
  constraint (E + O + E ) mod 10 == T 
  /\ (E + O + E) div 10 == c1;
  
  constraint (N + W + V + c1) mod 10 == H 
  /\ (N + W + V + c1) div 10 == c2;
  
  constraint (O + T + I + c2) mod 10 == G 
  /\ (O + T + I + c2) div 10 == c3;
  
  constraint (F + c3) mod 10 == I /\ (F + c3) div 10 == E; 
  
  constraint is_prime(NOW);
  
  solve satisfy;
  output[ "NOW = " ++ show(NOW)];
  
  % NOW = 467
  % ----------
  % ==========  
     
  
  

  LikeLike