Logic puzzle solution help

[emummel20]

Hey no rush but I was wondering if someone could help with the solution to this puzzle in uiua. I have the solution in another lang and I would love to compare the two. This one example would help me a lot in terms of how to think in the paradigm.

Thanks

[dilr]

I just started learning Uiua a couple days ago, but I gave this a shot to help me learn the language and came up with some pretty good solutions. I don't know if the match how other people use the language, but I think at least the first solution goes with the grain of how the language wants you to use it.

Both solutions are brute force attempts which try every possible answer against all previous attempts. The first:

SolvePasscode₃ ← |1 (
  # Generate all possible guesses
  ⟜(♭₂ ⇡ ↯:10 ⊣ △) # Input Guesses ? Input

  # Mask answering if each combination of guess
  # and input have exactly one matching digit.
  ⊸(= 1 ∵₁/+ ⊞=) # Mask Guesses ? Input Guesses

  # Return only guesses which are valid on all inputs
  ▽ /↧
)

I haven't been writing Uiua for that long, but I think this is probably about as clear as possible. (at least in terms of how the data flows through the program, there might be a better combination of primitives to use) Using ⍜now , I find that it takes a bit over 5ms to run on my machine with the inputs given. I am in the habit of trying to get things to run faster after getting them working, so here is a faster solution:

SolvePasscode₅ ← |1 (
  ⟜(♭₂ ⇡ ↯:10 ⊣ △) # Input Guesses ? Input

  ⊸(≡(=1 ∵₁/+= ¤) ⊙¤) # Mask Guesses ? Input Guesses
  ▽ /↧                # CorrectGuesses ? Mask Guesses
)

This uses ¤ inside and outside ≡ plus the pervasive = function to do the same thing as the ⊞ modifier, but it allows the sum reduction of the result before the entire mask is generated, which reduces peak memory usage. This runs in a bit more than 0.2ms on my machine. Its a bit harder to understand than the first solution, but it's nice to see such a minor modification can give an order of magnitude speedup.

As you can see by my naming scheme, I did try several other variations, but these are the most clear and fastest respectively.