I've been struggling like never before trying to figure out a problem in APL which involves getting values and scoring them like a poker game.
So I used
CHARS⍸CAR3
5 29 30 8 29 23 5
34 34 33 2 34 3 34
6 10 10 15 6 15 15
Which is an integer representation of characters in "deck" of car...
In APL, matrices and vectors are used to hold data. I was wondering if there was a way to search within a matrix for a given value, and have that values index returned. For example, say I have the following 2-dimensional matrices:
VALUES == 1 2 3 4 5 6 7 8 9 10 11... all the way up to 36
KINDS ...
APL (Dyalog Unicode), 24 bytes (Adám's SBCS)
f←{i∊(-@3∘⌽⌽)/⌽⍵,⍨i←⊂⍳3}
Try it online!
Well, this is embarrassing. At least I tried to.
The function is named f, and, in the test cases, 1 represents a left turn (boolean true) and 0 represents a right turn (boolean false). ⍬ represents the emp...
@EriktheOutgolfer ah :) but seriously, if you look closely at the conversation we had yesterday, you'd be able to deduce a more precise upper bound for my number of characters
@EriktheOutgolfer you're right, group theory is just the mathematical discipline that studies symmetries like that, but of course you can do without any formal knowledge about it - just with intuition
@EriktheOutgolfer by the way, in the dodecahedron variation (which is not covered by my bonus) it's much harder to come up with a purely intuitive solution
@EriktheOutgolfer yeah, but hash databases (rainbow tables?) probably focus on ascii...
@EriktheOutgolfer anyway, if you break the hash, you still get the 250 rep, as there's no way for me to tell how you arrived at the solution, but I suspect breaking the hash would be harder
I'll award 500 reputation to the first Dyalog APL solution to An Ant on a Cube that is shorter than my own (sha1: 96e876b41df54e13c0f662c897e4e4def7a143c4, I'm not revealing the exact length) and is submitted before 23:59 EET on 18 March 2018. I'll award 250 if the submitted solution is of the same length as mine.
next time i should salt it. not because it makes the hash significantly more secure, but because that would discourage people from wasting time on trying to break it
@ngn (AFAIK) salting wouldn't help you much. It only helps against dictionary attacks (who'd have an APL dictionary?) and batch attacks (here there's only one goal)
In APL, matrices and vectors are used to hold data. I was wondering if there was a way to search within a matrix for a given value, and have that values index returned. For example, say I have the following 2-dimensional matrices:
VALUES == 1 2 3 4 5 6 7 8 9 10 11... all the way up to 36
KINDS ...
APL (Dyalog Unicode), 24 bytes (Adám's SBCS)
f←{i∊(-@3∘⌽⌽)/⌽⍵,⍨i←⊂⍳3}
Try it online!
Well, this is embarrassing. At least I tried to.
The function is named f, and, in the test cases, 1 represents a left turn (boolean true) and 0 represents a right turn (boolean false). ⍬ represents the emp...
