For Phase 2:6, is there a line in the sand somewhere with which incomplete patterns should be coped with? The example gives "'Dddd' DDN 'Thursday'" for any Thursday of your choice -- but what about "'Dddd hh:mm' DDN 'Thursday 13:52''' for any Thursday at 13:52, or "'Mmmm Dddd hh:mm' DDN 'June Thursday 13:52' for any Thursday in any June at 13:52. Etc. Or is this a points for effort job?

@xpqz No limits.

Empty pattern: estimated birth point of universe.

There's no requirement for the answer to be the earliest possible, but string ≡ pattern (1200⌶) pattern DDN string must hold, so the birth point of the universe won't work, unless you believe in a very young Earth.

@PuercoPop (150=+/¨ps i)⊆(ps i) can be (⊢⊆⍨150=+/¨)ps i

Also does Dyalog avoid doing work it deems unnecessary? Because trying to store the powerset in an intermediate variable I get a WS full error, but if I continue to operate on it it works fine

@Adám Thanks! I have seen this right tack and flip idiom.

@PuercoPop Well, it is just a fork.

@PuercoPop I would need some test data to answer the first question.

You can replace the i with ex

OK.

ex is the example. i gets fed this file

github.com/PuercoPop/advent-of-code/blob/master/2015/17.input

@PuercoPop It will sometimes due to "idioms" but that doesn't seem to be the case here. Are you using TryAPL?

I'm using Ride right now, when I'm on my laptop I use the Dyalog Windows IDE

Hm, then I don't see how it would happen. Maybe you're trying to display it?

Yeah

The display code uses quite a bit of memory.

@PuercoPop Instead of filtering ⌿∘⍵¨ when all you ever need is the sum, how about summing the product of the mask and the original data?

For part 2 I need the sum to determine which subsets are a solution but then I need the length of the subsets to find how many solutions have the minimum length

Ah, you are saying to modify part of the powerset function? For that I need to understand how it works in the first place :|. That seemed more complicated

I've learnt more than I ever thought I needed to know about parsing dates in APL via this competition.

wow lol

speaking of the competition...

i only have 5 solutions for phase 1

and i havent looked at phase 2

and for 2solutions, i cant get the gold trophy...

I have implemented a string match automata for the date. but that's probably an overkill

@Richard probably base85, it only has one task (albeit with two parts) and it's relatively straightforward