S2T2

Jim Randell 11:08 am on 5 June 2026 Permalink Reply
Tags: by: Graham Smithers ( 86 )   

• 

  Jim Randell 11:09 am on 5 June 2026 Permalink | Reply

  Here is a solution using the [[ SubstitutedExpression.split_sum ]] solver from the enigma.py library.

  It runs in 116ms. (Internal runtime of the generated code is 2.5ms).

  #! python3 -m enigma -rr
  
  SubstitutedExpression.split_sum
  
  "A + GOOD + READ = TIMES"
  
  --extra="TI < 24"
  --extra="ME < 60"
  
  --answer="TIME"
  

  Solution: The time was: 15:30 (i.e. 3:30 pm).

  The sum is one of:

  TIMES = A + GOOD + READ
  15304 = 6 + 8229 + 7069
  15304 = 6 + 7229 + 8069

  Both of which give TIME = 1530.

  G and R are 7 and 8 in some order, and the values of the other letters are fixed.

  LikeLike

• 

  Ruud 1:47 pm on 5 June 2026 Permalink | Reply

  import peek
  import istr
  
  for ti, m, e in istr.product(range(10, 24), range(6), range(10)):
      if (time := ti | m | e).all_distinct():
          rest = set(istr.digits()) - set(time)
          for s, a, g, o, d, r in istr.permutations(rest, 6):
              if a and g and r and (times := time | s) == a + istr(":=good") + istr(":=read"):
                  peek(time, times, a, good, read)
  

  LikeLike

• 

  Ruud 6:53 am on 6 June 2026 Permalink | Reply

  Extreme brute force:

  import peek
  import istr
  for t, i, m, e, s, a, g, o, d, r in istr.permutations(range(10), 10):
      if t and a and g and r and istr('=ti') < 24 and m < 6 and istr("=times") == a + istr("=good") + istr("=read"):
          peek(istr("=time"))
  

  LikeLike